Abstract
In the context of waste classification, different categories of waste are collected and stored separately in each collection location, which makes the split transportation implement readily in the waste transportation problem. The split transportation refers to that trailers are allowed to visit each location several times to transport different categories of waste from collection locations to transfer stations. Since split transportation relaxes the basic assumption that each collection locationshould be visited exactly once, it would lead to flexible combinations of routes and help waste transportation departments or companies save on operational costs. In this paper, we present a novel waste transportation problem that extends the traditional waste transportation problem by introducing the concept of split transportation. We develop a mixed integer programming formulation and a branch-and-price-and-cut algorithm on an extended network to solve the investigated problem. The extended network simplifies the pricing subproblem, but renders high degeneration in column generation. Then, the stabilized technique is devised to speed up the convergence speed of the proposed algorithm. The efficiency of the proposed algorithm is tested on a real-world instance and a set of benchmark instances. Then, we discuss the impact of split transporation, demand intervals, and trailer capacity to give managerial insights for waste transportation departments or companies.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.