Search Results - subject:"routing problem"

New exact method for large asymmetric distance-constrained vehicle routing problem

Almoustafa, Samira; Hanafi, Said; Mladenović, Nenad - In: European Journal of Operational Research 226 (2013) 3, pp. 386-394

–constrained vehicle routing problem suggested by Laporte et al. in 1987. Our modification is based on reformulating distance …–constrained vehicle routing problem into a travelling salesman problem, and on using assignment problem as a lower bounding procedure. In … routing problem models from the recent literature. So, despite of its simplicity, this proposed algorithm is capable of …

Persistent link: https://www.econbiz.de/10011052779

MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems

Juan, Angel; Faulin, Javier; Ferrer, Albert; Lourenço, … - In: TOP: An Official Journal of the Spanish Society of … 21 (2013) 1, pp. 109-132

This paper discusses the use of probabilistic or randomized algorithms for solving vehicle routing problems with non-smooth objective functions. Our approach employs non-uniform probability distributions to add a biased random behavior to the well-known savings heuristic. By doing so, a large...

Persistent link: https://www.econbiz.de/10010995375

Using and extending fix-and-relax to solve maritime inventory routing problems

Uggen, Kristin; Fodstad, Marte; Nørstebø, Vibeke - In: TOP: An Official Journal of the Spanish Society of … 21 (2013) 2, pp. 355-377

The paper presents a new way of optimising maritime inventory routing problems (IRP) by using a heuristic approach based on fix-and-relax time decomposition extended with two new features. The purpose of the extensions is to reduce computation time during the fix-and-relax process and to improve...

Persistent link: https://www.econbiz.de/10010995382

Algorithm portfolios for logistics optimization considering stochastic demands and mobility allowance

Shukla, Nagesh; Choudhary, A.K.; Prakash, P.K.S.; … - In: International Journal of Production Economics 141 (2013) 1, pp. 146-166

The vehicle routing problem with stochastic demand (VRPSD) is a well known NP-hard problem. The uncharacteristic …

Persistent link: https://www.econbiz.de/10010594382

A coevolutionary algorithm for the flexible delivery and pickup problem with time windows

Wang, Hsiao-Fan; Chen, Ying-Yen - In: International Journal of Production Economics 141 (2013) 1, pp. 4-13

This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model in order to minimize the number of vehicles and to minimize the total traveling distance. This problem is shown to be NP-hard. In this...

Persistent link: https://www.econbiz.de/10010594393

Applications of the vehicle routing problem with trailers and transshipments

Drexl, Michael - In: European Journal of Operational Research 227 (2013) 2, pp. 275-283

The vehicle routing problem with trailers and transshipments (VRPTT) is a recent and challenging extension of the well …-known vehicle routing problem. The VRPTT constitutes an archetypal representative of the class of vehicle routing problems with …

Persistent link: https://www.econbiz.de/10010617167

VRP12 (vehicle routing problem with distances one and two) with side constraints

Ceranoglu, Ahmet N.; Duman, Ekrem - In: International Journal of Production Economics 144 (2013) 2, pp. 461-467

The problem undertaken in this study is inspired from a real life application. Consider a vehicle routing problem where …

Persistent link: https://www.econbiz.de/10010678879

A heuristic algorithm for the free newspaper delivery problem

Archetti, Claudia; Doerner, Karl F.; Tricoire, Fabien - In: European Journal of Operational Research 230 (2013) 2, pp. 245-257

the newspapers taken by the final readers. The resulting routing problem combines aspects of the vehicle routing problem … with time windows, the inventory routing problem, and additional constraints related to the production schedule. We propose …

Persistent link: https://www.econbiz.de/10010679118

Fourth party logistics routing problem with fuzzy duration time

Huang, Min; Cui, Yan; Yang, Shengxiang; Wang, Xingwei - In: International Journal of Production Economics 145 (2013) 1, pp. 107-116

logistics routing problem (4PLRP) is very difficult to solve because many issues, such as the selection of third party logistics …

Persistent link: https://www.econbiz.de/10010681843

Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

Zare Mehrjerdi, Yahia; Nadizadeh, Ali - In: European Journal of Operational Research 229 (2013) 1, pp. 75-84

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. In CLRP …-FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed, the vehicles and the …

Persistent link: https://www.econbiz.de/10010664715