Syracuse

Capacitated location routing problem with ?simultaneous pickup and delivery under the risk of ?disruption. Capacitated location routing problem with ?simultaneous pickup and delivery under the risk of ?disruption: .

Archive ouverte

Dehghan, M. | Hejazi, S. R. | Karimi Mamaghan, M. | Mohammadi, M. | Pirayesh, A.

Edité par CCSD ; EDP Sciences -

International audience. This paper develops a new mathematical model to study a location-routing problem withsimultaneous pickup and delivery under the risk of disruption. A remarkable number of previous studieshave assumed that network components (e.g., routes, production factories, depots, etc.) are alwaysavailable and can permanently serve the customers. This assumption is no longer valid when the networkfaces disruptions such as ood, earthquake, tsunami, terrorist attacks and workers strike. In case of anydisruption in the network, tremendous cost is imposed on the stockholders. Incorporating disruption inthe design phase of the network will alleviate the impact of these disasters and let the network resistdisruption. In this study, a mixed integer programming (MIP) model is proposed that formulates areliable capacitated location-routing problem with simultaneous pickup and delivery (RCLRP-SPD)services in supply chain distribution network. The objective function attempts to minimize the sumof location cost of depots, routing cost of vehicles and cost of unfullled demand of customers. Sincethe model is NP-Hard, three meta-heuristics are tailored for large-sized instances and the results showthe outperformance of hybrid algorithms comparing to classic genetic algorithm. Finally, the obtainedresults are discussed and the paper is concluded.

• Description
• Sujet/Public
• Outil
• Outil d'anticipation
• Mémoire et thèse
• Gestion