Truck and Motorcycle Routing Problem with Mobile Delivery Location

Please enable javascript in your browser.

Kazemi, Peyman | 2022

228 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 54976 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Akbari Jokar, Mohammad Reza
Abstract:
The emergence and development of E-commerce prompted many companies to reduce their cost by seeking new solutions that improve customer satisfaction level and product distribution. In this research, the coordination of a truck and a motorcycle is considered to utilize both vehicles' benefits. The mobile location of customers is another assumption in this research. Therefore, it is possible for customers to suggest different delivery times and locations. Based on the customer situation, there are three location modes which specify the accessibility. In this study, a mixed-integer linear programming model is presented to minimize service completion time. In addition, two metaheuristic algorithms, simulated annealing (SA) and variable neighborhood search (VNS) are designed to solve the problem in large-size instances. The results of algorithms are compared in the context of solution quality and computational time. Finally, sensitivity analysis is performed on some parameters of the problem
Keywords:
Vehicle Routing Problem ; Truck and Motorcycle Routing Problem ; Time Window ; Integer Programming ; Simulated Annealing Method ; Variable Neighborhood Search ; Synchronization Control ; Mobile Delivery Location

No TOC