|
A Bi-objective Model of Many-To-Many Hub Vehicle Location-Routing Problem by Considering Hard Time Window and Vehicle-Cost Balancing
|
Amir-Mohammad Golmohammadi   , Hamidreza Abedsoltan |
| Department of Industrial Engineering, Arak University, Arak, Iran. , a-golmohammadi@araku.ac.ir |
|
|
Abstract: (583 Views) |
Enhancing the efficacy and productivity of transportation system has been on the most common issues in recent decades, noteworthy to the industrial managers and expert so that the products are delivered to the clients at right time and the least costs. Therefore, there are two important issues; one is to create hub as the as intermediaries for streaming from multiple origins to multiple destinations and also responding to the tours of every hub at the proper time. The other is a route where the vehicles should pay at time window of each destination node. On the other hand, these problems may cause cost differences between hub and interruption of their balance. Accordingly, this paper presents a model dealing with cost balancing among the vehicles as well as reducing the total cost of the system. Given the multi-objective and NP-Hard nature of the issue, a multi-objective imperialist competitive algorithm (MOICA) is suggested to provide Pareto solutions. The provided solutions are at small, average and large scales are compared with the solutions provided by Non-Dominated Sorting Genetic Algorithm (NSGA-II) algorithm. Then, its performance is determined using the index for evaluating the algorithm performance efficacy to solve the problem at large dimensions.
|
|
| Keywords: Location-Routing Problem, Multiple Allocation, Hard Time Window, MOICA Algorithm |
|
|
Full-Text [PDF 537 kb]
(740 Downloads)
|
Type of Study: Original |
Subject:
Mathematical Modeling and Applications of OR
Received: 2024/04/12 | Accepted: 2024/04/23 | Published: 2024/04/25
|
|
|
|
|
|
|
| Send email to the article author |
|
|
|
| Add your comments about this article |
|
|
|
