Abstract
In this paper, we develop a novel integer programming model for the transportation problem of a consolidation network where a set of vehicles are used to transport goods from suppliers to their corresponding customers via three transportation systems: direct shipment, shipment through cross-dock (indirect shipment) and milk run. Since the proposed problem formulation is NP-hard, we offer a hybrid of harmony search (HS) and simulated annealing (SA) based heuristics (HS-SA algorithm) in order to solve the problem. The objective of this problem is to minimize the total shipping cost in the network, so it is tried to reduce the number of required vehicles using an efficient vehicle routing strategy in the algorithm. Solving several numerical examples demonstrates that our solving approach performs much better than GAMS/CPLEX in reducing both the shipping cost in the network and computational time requirement, especially for large size problem instances.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
