A guided local search heuristic for the capacitated arc routing problem

Author： Beullens P. Muyldermans L. Cattrysse D. Van Oudheusden D.

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.147, Iss.3, 2003-06, pp. : 629-643

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A heuristic algorithm for the Asymmetric Capacitated Vehicle Routing Problem

By Vigo D.

European Journal of Operational Research, Vol. 89, Iss. 1, 1996-02 ,pp. : 108-126

Elsevier

Access to resources Recommend Favorite

Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees

By Amberg A. Domschke W. Vosz S.

European Journal of Operational Research, Vol. 124, Iss. 2, 2000-07 ,pp. : 360-376

Elsevier

Access to resources Recommend Favorite

Genetic local search with distance preserving recombination operator for a vehicle routing problem

By Jaszkiewicz A. Kominek P.

European Journal of Operational Research, Vol. 151, Iss. 2, 2003-12 ,pp. : 352-364

Elsevier

Access to resources Recommend Favorite

Guided local search and its application to the traveling salesman problem

By Voudouris C. Tsang E.

European Journal of Operational Research, Vol. 113, Iss. 2, 1999-03 ,pp. : 469-499

Elsevier

Access to resources Recommend Favorite

A repeated matching heuristic for the single-source capacitated facility location problem

By Ronnqvist M. Tragantalerngsak S. Holt J.

European Journal of Operational Research, Vol. 116, Iss. 1, 1999-07 ,pp. : 51-68

Elsevier

Access to resources Recommend Favorite