Reaching the elementary lower bound in the vehicle routing problem with time windows

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|65|1|88-99

ISSN： 0028-3045

Source： NETWORKS: AN INTERNATIONAL JOURNAL, Vol.65, Iss.1, 2015-01, pp. : 88-99

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 Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows

By Tan K.   Chew Y.   Lee L.  

Computational Optimization and Applications, Vol. 34, Iss. 1, 2006-05 ,pp. : 115-151

Springer Publishing Company

Access to resources Recommend Favorite

Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows

By Guerriero F.   Di Puglia Pugliese L.  

Optimization Methods and Software, Vol. 26, Iss. 2, 2011-04 ,pp. : 295-340

Taylor & Francis Ltd

Access to resources Recommend Favorite

Ant Colony System for a Dynamic Vehicle Routing Problem

By Montemanni R.   Gambardella L.   Rizzoli A.   Donati A.  

Journal of Combinatorial Optimization, Vol. 10, Iss. 4, 2005-12 ,pp. : 327-343

Springer Publishing Company

Access to resources Recommend Favorite

Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands

By Bianchi Leonora   Birattari Mauro   Chiarandini Marco   Manfrin Max   Mastrolilli Monaldo   Paquete Luis   Rossi-Doria Olivia   Schiavinotto Tommaso  

Journal of Mathematical Modelling and Algorithms, Vol. 5, Iss. 1, 2006-04 ,pp. : 91-110

Springer Publishing Company

Access to resources Recommend Favorite

Optimal vehicle routing with lower and upper bounds on route durations

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 2, 2015-03 ,pp. : 166-179

John Wiley & Sons Inc

Access to resources Recommend Favorite