Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem

E-ISSN： 1475-3995|22|4|647-667

ISSN： 0969-6016

Source： INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, Vol.22, Iss.4, 2015-07, pp. : 647-667

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 memetic algorithm with iterated local search for the capacitated arc routing problem

By Liu Tiantang Jiang Zhibin Geng Na

International Journal of Production Research, Vol. 51, Iss. 10, 2013-05 ,pp. : 3075-3084

Taylor & Francis Ltd

Access to resources Recommend Favorite

Improved ant colony optimisation for the dynamic multi-depot vehicle routing problem

By Yu Bin

International Journal of Logistics, Vol. 16, Iss. 2, 2013-04 ,pp. : 144-157

Taylor & Francis Ltd

Access to resources Recommend Favorite

Iterated beam search for the combined car sequencing and level scheduling problem

By Yavuz Mesut

International Journal of Production Research, Vol. 51, Iss. 12, 2013-06 ,pp. : 3698-3718

Taylor & Francis Ltd

Access to resources Recommend Favorite

Modelling and solving the multiperiod inventory-routing problem with stochastic stationary demand rates

By Abdul Rahim Mohd Kamarul Irwan Zhong Yiqing Aghezzaf El-Houssaine Aouam Tarik

International Journal of Production Research, Vol. 52, Iss. 14, 2014-07 ,pp. : 4351-4363

Taylor & Francis Ltd

Access to resources Recommend Favorite

The bi-objective two-dimensional loading vehicle routing problem with partial conflicts

By Hamdi-Dhaoui Khaoula Labadie Nacima Yalaoui Alice

International Journal of Production Research, Vol. 52, Iss. 19, 2014-10 ,pp. : 5565-5582

Taylor & Francis Ltd

Access to resources Recommend Favorite