A tabu search heuristic for solving the multi-depot, multi-vehicle, double request dial-a-ride problem faced by a healthcare organisation

Author： Melachrinoudis Emanuel Min Hokey

Publisher： Inderscience Publishers

ISSN： 1745-7645

Source： International Journal of Operational Research, Vol.10, Iss.2, 2011-02, pp. : 214-239

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

Nested particle swarm optimisation for multi-depot vehicle routing problem

By Geetha S. Poonthalir G. Vanathi P.T.

International Journal of Operational Research, Vol. 16, Iss. 3, 2013-02 ,pp. : 329-348

Inderscience Publishers

Access to resources Recommend Favorite

Saving based algorithm for multi-depot version of vehicle routing problem with simultaneous pickup and delivery

By Gajpal Y. Abad P.L.

International Journal of Enterprise Network Management, Vol. 3, Iss. 3, 2010-04 ,pp. : 201-222

Inderscience Publishers

Access to resources Recommend Favorite

A contribution to the modelling and the resolution of a multi-objective dial a ride problem

By Zidi Issam

International Journal of Engineering Management and Economics, Vol. 3, Iss. 1-2, 2012-08 ,pp. : 95-116

Inderscience Publishers

Access to resources Recommend Favorite

A multi-depot travelling salesman problem and its iterative and integrated approaches

By Ho William Ji Ping Dey Prasanta K.

International Journal of Operational Research, Vol. 1, Iss. 4, 2006-07 ,pp. : 382-395

Inderscience Publishers

Access to resources Recommend Favorite

A tabu search heuristic for the concentrator location problem

By Filho V.J.M.F. Galvao R.D.

Location Science, Vol. 6, Iss. 1, 1998-05 ,pp. : 189-209

Elsevier

Access to resources Recommend Favorite