Abstract
This paper concerns the two-stage transportation problem with fixed charges associated to the routes and proposes an efficient multi-start Iterated Local Search (ILS) procedure for the total distribution costs minimization. Our heuristic approach constructs an initial solution, uses a local search procedure to increase the exploration, a perturbation mechanism and a neighborhood operator in order to diversify the search. Computational experiments were performed on two sets of instances: one that consists of 20 benchmark instances available in the literature and a second one that contains 10 new randomly generated larger instances. The achieved computational results prove that our proposed solution approach is highly competitive in comparison with the existing approaches from the literature.
Sign-in/Register to access full text options 
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.
