Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

How to Generate Benchmarks for Rich Routing Problems?

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9621))

Included in the following conference series:

  • 2421 Accesses

Abstract

In this paper, we show how to generate challenging benchmark tests for rich vehicle routing problems (VRPs) using a new heuristic algorithm (termed HeBeG—Heuristic Benchmark Generator). We consider a modified VRP with time windows, in which the depot does not define its time window. Additionally, the taxicab metric is utilized to determine the distance between travel points, instead of a standard Euclidean metric. HeBeG was used to create a test set for the qualifying round of Deadline24—an international 24-hour programming marathon. Finally, we compare the best results submitted to the server during the qualifying round of the contest with the routing schedules elaborated using other algorithms, including a new heuristics proposed in this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://www.sintef.no/projectweb/top/vrptw/.

  2. 2.

    For details see: https://www.deadline24.pl/.

  3. 3.

    For the details of these tests see: http://sun.aei.polsl.pl/~jnalepa/HeBeG/.

References

  1. Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput. 1–19 (2015). doi:10.1007/s00500-015-1642-4

    Google Scholar 

  2. Kalina, P., Vokrinek, J.: Parallel solver for vehicle routing and pickup and delivery problems with time windows based on agent negotiation. In: Proceedings of IEEE SMC, pp. 1558–1563 (2012)

    Google Scholar 

  3. Lau, H.C., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. Int. J. Artif. Intell. Tools 11(03), 455–472 (2002)

    Article  Google Scholar 

  4. Cordeau, J.F., Laporte, G., Savelsbergh, M.W., Vigo, D.: Chapter 6 vehicle routing. In: Barnhart, C., Laporte, G. (eds.) Transportation. Handbooks in Operations Research and Management Science, vol. 14, pp. 367–428. Elsevier (2007)

    Google Scholar 

  5. Bard, J.F., Kontoravdis, G., Yu, G.: A branch-and-cut procedure for the vehicle routing problem with time windows. Trans. Sci. 36(2), 250–269 (2002)

    Article  MATH  Google Scholar 

  6. Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4), 258–272 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Abdallah, K.S., Jang, J.: An exact solution for vehicle routing problems with semi-hard resource constraints. Comp. Ind. Eng. 76, 366–377 (2014)

    Article  Google Scholar 

  8. Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6(2), 171–197 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chabrier, A.: Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33(10), 2972–2990 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5), 1269–1283 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  11. Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 123–137. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Journal fur Betriebswirtschaft 58(1), 21–51 (2008)

    Article  Google Scholar 

  13. Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. 34(2), 107–121 (2000)

    Article  Google Scholar 

  14. Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)

    Article  Google Scholar 

  15. Nagata, Y., Kobayashi, S.: Guided ejection search for the pickup and delivery problem with time windows. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 202–213. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Nalepa, J., Blocho, M.: Co-operation in the parallel memetic algorithm. Int. J. Parallel Program. 43(5), 812–839 (2015)

    Article  Google Scholar 

  17. Cherkesly, M., Desaulniers, G., Laporte, G.: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62, 23–35 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

This work was performed using the infrastructure supported by the POIG.02.03.01-24-099/13 grant: “GeCONiI—Upper Silesian Center for Computational Science and Engineering”.

Author information

Authors and Affiliations

  1. Deadline24, Gliwice, Poland

    Marcin Cwiek, Jakub Nalepa & Marcin Dublanski

  2. Future Processing, Gliwice, Poland

    Marcin Cwiek, Jakub Nalepa & Marcin Dublanski

  3. Silesian University of Technology, Gliwice, Poland

    Jakub Nalepa

Authors
  1. Marcin Cwiek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakub Nalepa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcin Dublanski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jakub Nalepa .

Editor information

Editors and Affiliations

  1. Wrocław University of Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. Wrocław University of Technology, Wrocław, Poland

    Bogdan Trawiński

  3. Iwate Prefectural University, Takizawa, Japan

    Hamido Fujita

  4. National University of Kaohsiung, Kaohsiung, Taiwan

    Tzung-Pei Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cwiek, M., Nalepa, J., Dublanski, M. (2016). How to Generate Benchmarks for Rich Routing Problems?. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9621. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49381-6_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49381-6_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49380-9

  • Online ISBN: 978-3-662-49381-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation