IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v55y2004i7d10.1057_palgrave.jors.2601743.html
   My bibliography  Save this article

Vehicle routing in the 1-skip collection problem

Author

Listed:
  • C Archetti

    (University of Brescia)

  • M G Speranza

    (University of Brescia)

Abstract

In this paper, we consider a real problem, which we call the 1-skip collection problem, where a fleet of vehicles must collect a number of skips situated in different locations and transport them to one among different plants chosen on the basis of the kind of waste contained in the skip. Each vehicle has a capacity of one skip and it starts and ends its tour at the depot. Each time a vehicle collects a skip, it has to go to a plant and empty it. A number of constraints are imposed, which involve time windows for the customers and the plants, shift-time, different kinds of skips, number of drivers available to carry out the service and priorities assigned to the customers who have to be served. The objective is to minimize the total cost of the service given by the fixed cost of the drivers engaged to carry out the service, the cost of the extra time and the penalty cost paid if a customer is not served. A heuristic algorithm to solve the real problem is presented. The algorithm first constructs a feasible solution by means of the nearest-neighbour algorithm. Then, if it finds a feasible solution, it improves it. The computational results show that the solution of the algorithm is much better than the solution applied by the firm that carries out the service since it serves a higher number of skips with a smaller number of drivers.

Suggested Citation

  • C Archetti & M G Speranza, 2004. "Vehicle routing in the 1-skip collection problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 717-727, July.
    • Handle: RePEc:pal:jorsoc:v:55:y:2004:i:7:d:10.1057_palgrave.jors.2601743
    DOI: 10.1057/palgrave.jors.2601743
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601743
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601743?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. Angelelli, Enrico & Grazia Speranza, Maria, 2002. "The periodic vehicle routing problem with intermediate facilities," European Journal of Operational Research, Elsevier, vol. 137(2), pages 233-247, March.
    2. E Angelelli & M G Speranza, 2002. "The application of a vehicle routing model to a waste-collection problem: two case studies," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(9), pages 944-952, September.
    3. Lawrence Bodin & Aristide Mingozzi & Roberto Baldacci & Michael Ball, 2000. "The Rollon–Rolloff Vehicle Routing Problem," Transportation Science, INFORMS, vol. 34(3), pages 271-288, August.
    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. Abdelkader Sbihi & Richard Eglese, 2010. "Combinatorial optimization and Green Logistics," Annals of Operations Research, Springer, vol. 175(1), pages 159-175, March.
    2. 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.
    3. Roberto Aringhieri & Maurizio Bruglieri & Federico Malucelli & Maddalena Nonato, 2018. "A Special Vehicle Routing Problem Arising in the Optimization of Waste Disposal: A Real Case," Transportation Science, INFORMS, vol. 52(2), pages 277-299, March.
    4. Bogh, Morten Bie & Mikkelsen, Hardy & Wøhlk, Sanne, 2014. "Collection of recyclables from cubes – A case study," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 127-134.
    5. Leonardo Berbotto & Sergio García & Francisco Nogales, 2014. "A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem," Annals of Operations Research, Springer, vol. 222(1), pages 153-173, November.
    6. Vera C. Hemmelmayr & Karl F. Doerner & Richard F. Hartl & Daniele Vigo, 2014. "Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management," Transportation Science, INFORMS, vol. 48(1), pages 103-120, February.
    7. Wy, Juyoung & Kim, Byung-In & Kim, Seongbae, 2013. "The rollon–rolloff waste collection vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 224(3), pages 466-476.

    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. Gläser, Sina, 2022. "A waste collection problem with service type option," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1216-1230.
    2. Markov, Iliya & Varone, Sacha & Bierlaire, Michel, 2016. "Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 256-273.
    3. Belien, Jeroen & De Boeck, Liesje & Van Ackere, Jonas, 2011. "Municipal Solid Waste Collection Problems: A Literature Review," Working Papers 2011/34, Hogeschool-Universiteit Brussel, Faculteit Economie en Management.
    4. Crevier, Benoit & Cordeau, Jean-Francois & Laporte, Gilbert, 2007. "The multi-depot vehicle routing problem with inter-depot routes," European Journal of Operational Research, Elsevier, vol. 176(2), pages 756-773, January.
    5. Miranda, Pablo A. & Blazquez, Carola A. & Vergara, Rodrigo & Weitzler, Sebastian, 2015. "A novel methodology for designing a household waste collection system for insular zones," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 77(C), pages 227-247.
    6. Sohrabi, Somayeh & Ziarati, Koorush & Keshtkaran, Morteza, 2020. "A Greedy Randomized Adaptive Search Procedure for the Orienteering Problem with Hotel Selection," European Journal of Operational Research, Elsevier, vol. 283(2), pages 426-440.
    7. Divsalar, A. & Vansteenwegen, P. & Sörensen, K. & Cattrysse, D., 2014. "A memetic algorithm for the orienteering problem with hotel selection," European Journal of Operational Research, Elsevier, vol. 237(1), pages 29-49.
    8. Pearce, Joshua M. & Johnson, Sara J. & Grant, Gabriel B., 2007. "3D-mapping optimization of embodied energy of transportation," Resources, Conservation & Recycling, Elsevier, vol. 51(2), pages 435-453.
    9. 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.
    10. CASTRO, Marco & SÖRENSEN, Kenneth & VANSTEENWEGEN, Pieter & GOOS, Peter, 2012. "A simple GRASP+VND for the travelling salesperson problem with hotel selection," Working Papers 2012024, University of Antwerp, Faculty of Business and Economics.
    11. Davis, Lauren B. & Sengul, Irem & Ivy, Julie S. & Brock, Luther G. & Miles, Lastella, 2014. "Scheduling food bank collections and deliveries to ensure food safety and improve access," Socio-Economic Planning Sciences, Elsevier, vol. 48(3), pages 175-188.
    12. Abdelkader Sbihi & Richard Eglese, 2010. "Combinatorial optimization and Green Logistics," Annals of Operations Research, Springer, vol. 175(1), pages 159-175, March.
    13. S Y Sohn & Y Kim & B T Kim, 2009. "Cost of ownership model for spare engines purchase for the Korean navy acquisition program," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1674-1682, December.
    14. Aksen, Deniz & Kaya, Onur & Sibel Salman, F. & Tüncel, Özge, 2014. "An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 413-426.
    15. Lin, Yen-Hung & Batta, Rajan & Rogerson, Peter A. & Blatt, Alan & Flanigan, Marie, 2011. "A logistics model for emergency supply of critical items in the aftermath of a disaster," Socio-Economic Planning Sciences, Elsevier, vol. 45(4), pages 132-145, December.
    16. Gläser, Sina & Stücken, Mareike, 2021. "Introduction of an underground waste container system–model and solution approaches," European Journal of Operational Research, Elsevier, vol. 295(2), pages 675-689.
    17. Mingyue Shao & Dongxu Chen & Xiaolong Lu & Xuefei Liu & Zhongzhen Yang, 2023. "Does Drop and Pull Transport Have a Chance? The Case of China," Sustainability, MDPI, vol. 15(13), pages 1-20, June.
    18. Jesus Gonzalez-Feliu, 2009. "The N-echelon Location routing problem: concepts and methods for tactical and operational planning," Working Papers halshs-00422492, HAL.
    19. Peter Francis & Karen Smilowitz & Michal Tzur, 2007. "Flexibility and complexity in periodic distribution problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 136-150, March.
    20. CASTRO, Marco & SÖRENSEN, Kenneth & GOOS, Peter & VANSTEENWEGEN, Pieter, 2014. "The multiple travelling salesperson problem with hotel selection," Working Papers 2014030, University of Antwerp, Faculty of Business and Economics.

    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:pal:jorsoc:v:55:y:2004:i:7:d:10.1057_palgrave.jors.2601743. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.