[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v132y2019icp141-162.html
   My bibliography  Save this article

The split-delivery mixed capacitated arc-routing problem: Applications and a forest-based tabu search approach

Author

Listed:
  • Yu, Mingzhu
  • Jin, Xin
  • Zhang, Zizhen
  • Qin, Hu
  • Lai, Qidong
Abstract
Motivated by practical applications such as the water sprinkling services of urban administration bureaus in big cities, we study a split-delivery mixed capacitated arc-routing problem. In this problem, a fleet of capacitated vehicles need to serve a set of arcs/edges in a split delivery manner by traversing a mixed graph. We provide a mathematical formulation and analyze some properties of the problem that could be utilized to accelerate the search process of a meta-heuristic algorithm. A forest-based tabu search algorithm is proposed to efficiently solve the problem. Numerical experiments show that our algorithm can quickly produce high quality solutions compared with the state-of-the-art approaches. In addition, we analyze how different patterns of a mixed graph affect the quality of solutions.

Suggested Citation

  • Yu, Mingzhu & Jin, Xin & Zhang, Zizhen & Qin, Hu & Lai, Qidong, 2019. "The split-delivery mixed capacitated arc-routing problem: Applications and a forest-based tabu search approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 141-162.
    • Handle: RePEc:eee:transe:v:132:y:2019:i:c:p:141-162
    DOI: 10.1016/j.tre.2019.09.017
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554518312225
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tre.2019.09.017?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. M. Belenguer & M. C. Martinez & E. Mota, 2000. "A Lower Bound for the Split Delivery Vehicle Routing Problem," Operations Research, INFORMS, vol. 48(5), pages 801-810, October.
    2. Enrico Bartolini & Jean-François Cordeau & Gilbert Laporte, 2013. "An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand," Operations Research, INFORMS, vol. 61(2), pages 315-327, April.
    3. Kasaei, Maziar & Salman, F. Sibel, 2016. "Arc routing problems to restore connectivity of a road network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 177-206.
    4. Santos, Luís & Coutinho-Rodrigues, João & Current, John R., 2010. "An improved ant colony optimization based algorithm for the capacitated arc routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 44(2), pages 246-266, February.
    5. Lee, Chi-Guhn & Epelman, Marina A. & White III, Chelsea C. & Bozer, Yavuz A., 2006. "A shortest path approach to the multiple-vehicle routing problem with split pick-ups," Transportation Research Part B: Methodological, Elsevier, vol. 40(4), pages 265-284, May.
    6. Chen, Yuning & Hao, Jin-Kao & Glover, Fred, 2016. "A hybrid metaheuristic approach for the capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 25-39.
    7. Fung, Richard Y.K. & Liu, Ran & Jiang, Zhibin, 2013. "A memetic algorithm for the open capacitated arc routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 53-67.
    8. Claudia Bode & Stefan Irnich, 2012. "Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem," Operations Research, INFORMS, vol. 60(5), pages 1167-1182, October.
    9. Alain Hertz & Gilbert Laporte & Michel Mittaz, 2000. "A Tabu Search Heuristic for the Capacitated arc Routing Problem," Operations Research, INFORMS, vol. 48(1), pages 129-135, February.
    10. Mauro Dell’Amico & José Carlos Díaz Díaz & Geir Hasle & Manuel Iori, 2016. "An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem," Transportation Science, INFORMS, vol. 50(4), pages 1223-1238, November.
    11. Moshe Dror & Pierre Trudeau, 1989. "Savings by Split Delivery Routing," Transportation Science, INFORMS, vol. 23(2), pages 141-145, May.
    12. Chen, Yuning & Hao, Jin-Kao, 2018. "Two phased hybrid local search for the periodic capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 55-65.
    13. Philippe Lacomme & Christian Prins & Wahiba Ramdane-Cherif, 2004. "Competitive Memetic Algorithms for Arc Routing Problems," Annals of Operations Research, Springer, vol. 131(1), pages 159-185, October.
    14. José-Manuel Belenguer & Enrique Benavent & Nacima Labadi & Christian Prins & Mohamed Reghioui, 2010. "Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic," Transportation Science, INFORMS, vol. 44(2), pages 206-220, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pourhejazy, Pourya & Zhang, Dali & Zhu, Qinghua & Wei, Fangfang & Song, Shuang, 2021. "Integrated E-waste transportation using capacitated general routing problem with time-window," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).
    2. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Thibaut Vidal, 2017. "Node, Edge, Arc Routing and Turn Penalties: Multiple Problems—One Neighborhood Extension," Operations Research, INFORMS, vol. 65(4), pages 992-1010, August.
    2. Li, Jiliu & Qin, Hu & Shen, Huaxiao & Tsui, Kwok Leung, 2019. "The unilateral transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 1-29.
    3. Jesica Armas & Peter Keenan & Angel A. Juan & Seán McGarraghy, 2019. "Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 135-162, February.
    4. Chen, Yuning & Hao, Jin-Kao, 2018. "Two phased hybrid local search for the periodic capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 55-65.
    5. José-Manuel Belenguer & Enrique Benavent & Nacima Labadi & Christian Prins & Mohamed Reghioui, 2010. "Split-Delivery Capacitated Arc-Routing Problem: Lower Bound and Metaheuristic," Transportation Science, INFORMS, vol. 44(2), pages 206-220, May.
    6. Chen, Yuning & Hao, Jin-Kao & Glover, Fred, 2016. "A hybrid metaheuristic approach for the capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 253(1), pages 25-39.
    7. Zsuzsanna Nagy & Ágnes Werner-Stark & Tibor Dulai, 2022. "An Artificial Bee Colony Algorithm for Static and Dynamic Capacitated Arc Routing Problems," Mathematics, MDPI, vol. 10(13), pages 1-38, June.
    8. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    9. Jianli Shi & Jin Zhang & Kun Wang & Xin Fang, 2018. "Particle Swarm Optimization for Split Delivery Vehicle Routing Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(02), pages 1-42, April.
    10. Saman Eskandarzadeh & Reza Tavakkoli-Moghaddam & Amir Azaron, 2009. "An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems," Journal of Combinatorial Optimization, Springer, vol. 17(2), pages 214-234, February.
    11. Yang, Xuan & Kong, Xiang T.R. & Huang, George Q., 2024. "Synchronizing crowdsourced co-modality between passenger and freight transportation services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    12. Berbotto, Leonardo & García, Sergio & Nogales, Francisco J., 2011. "A vehicle routing model with split delivery and stop nodes," DES - Working Papers. Statistics and Econometrics. WS ws110906, Universidad Carlos III de Madrid. Departamento de Estadística.
    13. Guy Desaulniers, 2010. "Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows," Operations Research, INFORMS, vol. 58(1), pages 179-192, February.
    14. Yu, Yugang & Chen, Haoxun & Chu, Feng, 2008. "A new model and hybrid approach for large scale inventory routing problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1022-1040, September.
    15. Jin, Mingzhou & Liu, Kai & Bowden, Royce O., 2007. "A two-stage algorithm with valid inequalities for the split delivery vehicle routing problem," International Journal of Production Economics, Elsevier, vol. 105(1), pages 228-242, January.
    16. Gizem Ozbaygin & Oya Karasan & Hande Yaman, 2018. "New exact solution approaches for the split delivery vehicle routing problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 85-115, March.
    17. C. Archetti & M. Bouchard & G. Desaulniers, 2011. "Enhanced Branch and Price and Cut for Vehicle Routing with Split Deliveries and Time Windows," Transportation Science, INFORMS, vol. 45(3), pages 285-298, August.
    18. Porumbel, Daniel & Goncalves, Gilles & Allaoui, Hamid & Hsu, Tienté, 2017. "Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem," European Journal of Operational Research, Elsevier, vol. 256(2), pages 349-367.
    19. Bode, Claudia & Irnich, Stefan, 2014. "The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 415-426.
    20. Salazar-González, Juan-José & Santos-Hernández, Beatriz, 2015. "The split-demand one-commodity pickup-and-delivery travelling salesman problem," Transportation Research Part B: Methodological, Elsevier, vol. 75(C), pages 58-73.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:132:y:2019:i:c:p:141-162. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.