IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v78y2021i4d10.1007_s11235-021-00833-7.html
   My bibliography  Save this article

Compact Sine Cosine Algorithm applied in vehicle routing problem with time window

Author

Listed:
  • Jeng-Shyang Pan

    (Shandong University of Science and Technology)

  • Qing-yong Yang

    (Shandong University of Science and Technology)

  • Shu-Chuan Chu

    (Shandong University of Science and Technology)

  • Kuo-Chi Chang

    (Fujian University of Technology)

Abstract

In this paper, the compact Sine Cosine Algorithm (cSCA) is proposed. The cSCA algorithm is not based on population, but simulates the behavior of the actual population through a probability model called virtual population. Compared with the original algorithm, the cSCA algorithm takes up less memory space. However, frequent sampling may lead to poor solution quality. In view of this situation, this paper introduces the intergenerational generation sampling mechanism to improve the cSCA algorithm. Through the CEC2013 function set test, compared with the original SCA algorithm and other compact algorithms, the algorithm proposed in this paper can show strong solving ability. Finally, this paper describes how to apply the proposed algorithm and the SCA algorithm to solve the vehicle routing problem with time window in transportation. The quality of the solution is further improved by introducing the relocate operator. Through Solomon standard test data, the calculation performance of the algorithms is verified.

Suggested Citation

  • Jeng-Shyang Pan & Qing-yong Yang & Shu-Chuan Chu & Kuo-Chi Chang, 2021. "Compact Sine Cosine Algorithm applied in vehicle routing problem with time window," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 78(4), pages 609-628, December.
  • Handle: RePEc:spr:telsys:v:78:y:2021:i:4:d:10.1007_s11235-021-00833-7
    DOI: 10.1007/s11235-021-00833-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-021-00833-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-021-00833-7?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. Olli Bräysy & Michel Gendreau, 2002. "Tabu Search heuristics for the Vehicle Routing Problem with Time Windows," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(2), pages 211-237, December.
    2. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    3. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    4. Éric Taillard & Philippe Badeau & Michel Gendreau & François Guertin & Jean-Yves Potvin, 1997. "A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows," Transportation Science, INFORMS, vol. 31(2), pages 170-186, May.
    5. Ai-Qing Tian & Shu-Chuan Chu & Jeng-Shyang Pan & Huanqing Cui & Wei-Min Zheng, 2020. "A Compact Pigeon-Inspired Optimization for Maximum Short-Term Generation Mode in Cascade Hydroelectric Power Station," Sustainability, MDPI, vol. 12(3), pages 1-19, January.
    6. Wang, Feng & Zhang, Jian & Xu, Xing & Cai, Yingfeng & Zhou, Zhiguang & Sun, Xiaoqiang, 2019. "A comprehensive dynamic efficiency-enhanced energy management strategy for plug-in hybrid electric vehicles," Applied Energy, Elsevier, vol. 247(C), pages 657-669.
    7. Jonathan F. Bard & George Kontoravdis & Gang Yu, 2002. "A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 36(2), pages 250-269, May.
    8. Li, Haibing & Lim, Andrew, 2003. "Local search with annealing-like restarts to solve the VRPTW," European Journal of Operational Research, Elsevier, vol. 150(1), pages 115-127, October.
    9. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    Full references (including those not matched with items on IDEAS)

    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. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    2. Michael Schneider & Andreas Stenger & Dominik Goeke, 2014. "The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations," Transportation Science, INFORMS, vol. 48(4), pages 500-520, November.
    3. Ciancio, Claudio & Laganá, Demetrio & Vocaturo, Francesca, 2018. "Branch-price-and-cut for the Mixed Capacitated General Routing Problem with Time Windows," European Journal of Operational Research, Elsevier, vol. 267(1), pages 187-199.
    4. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    5. Schyns, M., 2015. "An ant colony system for responsive dynamic vehicle routing," European Journal of Operational Research, Elsevier, vol. 245(3), pages 704-718.
    6. Gmira, Maha & Gendreau, Michel & Lodi, Andrea & Potvin, Jean-Yves, 2021. "Tabu search for the time-dependent vehicle routing problem with time windows on a road network," European Journal of Operational Research, Elsevier, vol. 288(1), pages 129-140.
    7. Schneider, Michael, 2016. "The vehicle-routing problem with time windows and driver-specific times," European Journal of Operational Research, Elsevier, vol. 250(1), pages 101-119.
    8. Cortés, Cristián E. & Gendreau, Michel & Rousseau, Louis Martin & Souyris, Sebastián & Weintraub, Andrés, 2014. "Branch-and-price and constraint programming for solving a real-life technician dispatching problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 300-312.
    9. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    10. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    11. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    12. Ehmke, Jan Fabian & Campbell, Ann Melissa, 2014. "Customer acceptance mechanisms for home deliveries in metropolitan areas," European Journal of Operational Research, Elsevier, vol. 233(1), pages 193-207.
    13. Andrew Lim & Xingwen Zhang, 2007. "A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 443-457, August.
    14. Andres Figliozzi, Miguel, 2012. "The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 616-636.
    15. Yan Cheng Hsu & Jose L. Walteros & Rajan Batta, 2020. "Solving the petroleum replenishment and routing problem with variable demands and time windows," Annals of Operations Research, Springer, vol. 294(1), pages 9-46, November.
    16. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    17. Fröhlich von Elmbach, Alexander & Scholl, Armin & Walter, Rico, 2019. "Minimizing the maximal ergonomic burden in intra-hospital patient transportation," European Journal of Operational Research, Elsevier, vol. 276(3), pages 840-854.
    18. Ehsan Khodabandeh & Lihui Bai & Sunderesh S. Heragu & Gerald W. Evans & Thomas Elrod & Mark Shirkness, 2017. "Modelling and solution of a large-scale vehicle routing problem at GE appliances & lighting," International Journal of Production Research, Taylor & Francis Journals, vol. 55(4), pages 1100-1116, February.
    19. Md. Anisul Islam & Yuvraj Gajpal, 2021. "Optimization of Conventional and Green Vehicles Composition under Carbon Emission Cap," Sustainability, MDPI, vol. 13(12), pages 1-20, June.
    20. Alcaraz, Juan J. & Caballero-Arnaldos, Luis & Vales-Alonso, Javier, 2019. "Rich vehicle routing problem with last-mile outsourcing decisions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 129(C), pages 263-286.

    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:spr:telsys:v:78:y:2021:i:4:d:10.1007_s11235-021-00833-7. 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.springer.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.