|
|
|
|
|
 |
Search published articles |
 |
|
Showing 2 results for Meta-Heuristic Algorithm
Mr. Mirmohammad Musavi, Dr. Reza Tavakkoli-Moghaddam, Ms. Farnaz Rayat,
Volume 8, Issue 1 (4-2017)
Abstract
We present a bi-objective model for a green truck scheduling and routing problem at a cross-docking system. This model determines three key decisions at the cross dock: (1) defining a sequence and schedule of inbound trucks at the receiving door, (2) specifying a sequence and a schedule of outbound trucks at the shipping door, and (3) determining the routes of the outbound truck while serving customers. The first objective function is related to responsiveness of the network that minimizes time window violations and the second objective function minimizes total fuel consumption of trucks in order to consider the environmental factor of the network. Also, a learning effect is considered in loading and unloading process times. To solve the bi-objective model, an archived multi-objective simulated annealing (AMOSA) is used and modified. Finally, a number of test problems are solved and the efficiency of the proposed AMOSA is compared with the e-constraint method.
Dr Amir-Mohammad Golmohammadi,
Volume 16, Issue 1 (3-2025)
Abstract
Facility location and routing problems have attracted significant research attention since the 1960s due to their practical relevance and complexity. Efficiently establishing production facilities, optimizing vehicle routes, and implementing effective inventory systems are essential for improving organizational performance. In this study, we propose an integrated location-routing model for the pharmaceutical supply chain, designed to satisfy all retailer demands through an appropriate inventory policy, ensuring no demand is unmet. The proposed mixed-integer mathematical model considers a four-tier supply chain, including manufacturers, distributors, wholesalers, and retailers, with the objective of establishing cost-effective warehouses while fulfilling all demand requirements. Demand uncertainty is addressed using a scenario-based probabilistic approach. The model is solved using GAMS for a small-scale case study. For larger-scale instances, where exact solutions are computationally challenging, a meta-heuristic approach—specifically, a genetic algorithm—is employed to efficiently obtain near-optimal solutions.
|
|
|
|
|
|
|
|
|
