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

Author： Amberg A.   Domschke W.   Vosz S.  

Publisher： Elsevier

ISSN： 0377-2217

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

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 guided local search heuristic for the capacitated arc routing problem

By Beullens P.   Muyldermans L.   Cattrysse D.   Van Oudheusden D.  

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

Elsevier

Access to resources Recommend Favorite

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

An exact algorithm for the capacitated facility location problems with single sourcing

By Holmberg K.   Ronnqvist M.   Yuan D.  

European Journal of Operational Research, Vol. 113, Iss. 3, 1999-03 ,pp. : 544-559

Elsevier

Access to resources Recommend Favorite

A tabu search algorithm for the multi-trip vehicle routing and scheduling problem

By Brandao J.   Mercer A.  

European Journal of Operational Research, Vol. 100, Iss. 1, 1997-07 ,pp. : 180-191

Elsevier

Access to resources Recommend Favorite

Capacitated facility location/network design problems

By Melkote S.   Daskin M.S.  

European Journal of Operational Research, Vol. 129, Iss. 3, 2001-03 ,pp. : 481-495

Elsevier

Access to resources Recommend Favorite