Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.206, Iss.1, 2013-07, pp. : 1-22

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 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

Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

By Bräysy Olli Dullaert Wout Gendreau Michel

Journal of Heuristics, Vol. 10, Iss. 6, 2004-12 ,pp. : 587-611

Springer Publishing Company

Access to resources Recommend Favorite

Heuristic methods for vehicle routing problem with time windows

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

Artificial Intelligence in Engineering, Vol. 15, Iss. 3, 2001-07 ,pp. : 281-295

Elsevier

Access to resources Recommend Favorite

Two approaches to solving the multi-depot vehicle routing problem with time windows in a time-based logistics environment

By Chiu Huan Neng

Production Planning and Control, Vol. 17, Iss. 5, 2006-07 ,pp. : 480-493

Taylor & Francis Ltd

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