Recent progress of local search in handling the time window constraints of the vehicle routing problem

Author： Hashimoto Hideki  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.204, Iss.1, 2013-04, pp. : 171-187

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 parallel algorithm for the vehicle routing problem with time window constraints

By Schulze J.   Fahle T.  

Annals of Operations Research, Vol. 86, Iss. 1, 1999-01 ,pp. : 585-607

Springer Publishing Company

Access to resources Recommend Favorite

Artificial intelligence heuristics in solving vehicle routing problems with time window constraints

By Tan K.C.   Lee L.H.   Ou K.  

Engineering Applications of Artificial Intelligence, Vol. 14, Iss. 6, 2001-12 ,pp. : 825-837

Elsevier

Access to resources Recommend Favorite

A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows

By Polacek Michael   Hartl Richard F.   Doerner Karl   Reimann Marc  

Journal of Heuristics, Vol. 10, Iss. 6, 2004-12 ,pp. : 613-627

Springer Publishing Company

Access to resources Recommend Favorite

A hybrid search method for the vehicle routing problem with time windows

By Brandão de Oliveira Humberto  

Annals of Operations Research, Vol. 180, Iss. 1, 2010-11 ,pp. : 125-144

Springer Publishing Company

Access to resources Recommend Favorite

New Evolutionary Algorithm Based on 2-Opt Local Search to Solve the Vehicle Routing Problem with Private Fleet and Common Carrier

By  

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 2, Iss. 1, 2011-01 ,pp. : 58-82

IGI Global_journal

Access to resources Recommend Favorite