Solving a multi-objective multi-depot stochastic location-routing problem by a hybrid simulated annealing algorithm

Abstract

This paper presents a novel mathematical model for a stochastic location-routing problem (SLRP) that minimizes the facilities establishing cost and transportation cost, and maximizes the probability of delivery to customers. In this proposed model, new aspects of a location-routing problem (LRP), such as stochastic availability of facilities and routes, are developed that are similar to real-word problems. The proposed model is solved in two stages: (i) solving the facility location problem (FLP) by a mathematical algorithm and (ii) solving the multi-objective multi-depot vehicle routing problem (MO-MDVRP) by a simulated annealing (SA) algorithm hybridized by genetic operators, namely mutation and crossover. The proposed SA can find good solutions in a reasonable time. It solves the proposed model in large-scale problems with acceptable results. Finally, a trade-off curve is used to depict and discuss a large-sized problem. The associated results are compared with the results obtained by the lower bound and Lingo 8.0 software.

Keywords

stochastic location-routing problem multi-objective model set-covering simulated annealing

References

Nagy

Salhi

, ‘Location-routing: Issues, models and methods’ Eur. J. Oper. Res. 176 (2007): 649–672.

Min

Jayaraman

Srivastava

, ‘Combined location-routing problem: A synthesis and future research directions’ Eur. J. Oper. Res. 108 (1998): 1–15.

Lee

S. D.

Chang

W. T.

, ‘On solving the discrete location problems when the facilities are prone to failure’ Appl. Math. Modeling 31 (2007): 817–831.

Hwang

H. S.

, ‘A stochastic set-covering location model for both ameliorating and deteriorating items’ Comput. Ind. Engng 46 (2004): 313–319.

Hwang

H. S.

, ‘Design of supply-chain logistics system considering service level’ Comput. Ind. Engng 43 (2002): 283–297.

Rajagopalan

H. K.

Saydam

Xiao

, ‘A multiperiod set covering location model for dynamic redeployment of ambulances’ Comput. Oper. Res. 35 (2008): 814–826.

T. H.

Low

Bai

J. W.

, ‘Heuristic solution to multi-depot location-routing problems’ Comput. Oper. Res. 29 (2002): 1393–1415.

Albareda-Sambola

Fernandez

Laporte

, ‘Heuristic and lower bound for a stochastic location-routing problem’ Eur. J. Oper. Res. 179 (2007): 940–955.

Doerner

Focke

Gujahr

W. J.

, ‘Multicriteria tour planning for mobile healthcare facilities in a developing country’ Eur. J. Oper. Res. 179 (2007): 1078–1096.

10.

Zhou

Min

Gen

, ‘A genetic algorithm approach to the bi-criteria allocation of customers to warehouses’ Int. J. Prod. Econ. 86 (2003): 34–45.

11.

Caballero

Gonzalez

Guerrero

F. M.

Molina

Paralera

, ‘Solving a multiobjective location-routing problem with a metaheuristic based on tabu search: Application to a real case in Andalusia’ Eur. J. Oper. Res. 176 (2007): 1751–1763.

12.

Alumar

Kara

B. Y.

, ‘A new model for the hazardous waste location-routing problem’ Comput. Oper. Res. 34 (2007): 1406–1423.

13.

Erkut

Alp

, ‘Designing a road network for hazardous material shipment’ Comput. Oper. Res. 34 (2007): 1389–1405.

14.

Hassan-Pour

H. A.

Mosadegh-Khah

Tavakkoli-Moghaddam

, ‘Design of mathematical models for a stochastic location-routing problem’ In Proceedings of the Fifth International Conference on Industrial engineering, Tehran, Iran, 2007.

15.

Rahimi-Vahed

A. R.

Rabbani

Tavakkoli-Moghaddam

Torabi

S. A.

Jolai

, ‘A multi-objective scatter search for mixed-model assembly line sequencing problem’ Adv. Engng Informatics 21 (2007): 85–99.

16.

Deb

, Multi-objective optimization using evolutionary algorithms (Chichester: Wiley 2003).

17.

Kirkpatrick

Gelatt

Jr Vecchi

, ‘Optimization by simulated annealing’ Science 220 (1983): 671–680.

18.

Tavakkoli-Moghaddam

Saffaei

Kah

M. M. O.

Rabbani

, ‘A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing’ J. Franklin Institute 344 (5) (2007): 406–425.