Skip to main content
SpringerLink
Log in

A heuristic repair method for dial-a-ride problem in intracity logistic based on neighborhood shrinking

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

The Dial-a-ride problem (DARP) is a challenging combinatorial optimization problem with lots of applications in the real world. It has so many applications in the smart city like bus intelligent scheduling and taxi intelligent scheduling. However, most of these works rarely address how to handle the infeasible initial solution. The infeasible solution is an unstable factor in the search framework which gives a negative influence on the quality of the final local optimal solution. In this paper, we present a heuristic repair method (HRM) for DARP. Based on a greedy strategy and proper evaluation function, the HRM will reduce the infeasibility of the most infeasible route by deleting several waypoints in the route and reinsert them into one feasible route. The result of experiments shows that HRM can raise about 50% of the fixing ability of a local search operator.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  1. Acampora G, Vitiello A (2020) A Study on Local Search Meta-heuristics for Ontology Alignment. Computational Intelligence for Semantic Knowledge Management - New Perspectives for Designing and Organizing Information Systems 837:53–70

    Google Scholar 

  2. Arya V, Garg N, Khandekar R, Meyerson A, Munagala K, Pandit V (2004) Local search heuristics for k-median and facility location problems. SIAM J Comput 33(3):544–562

    Article  MathSciNet  Google Scholar 

  3. Bagger NF, Sørensen M, Stidsen TR (2019) Dantzig-wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling. European Journal of Operational Research 272(2):430–446

    Article  MathSciNet  Google Scholar 

  4. Bartels RH, Golub GH (1969) The simplex method of linear programming using LU decomposition. CommunȦCM 12(5):266–268

    MATH  Google Scholar 

  5. Belhaiza S (2019) A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem. Algorithms 12(2):39

    Article  MathSciNet  Google Scholar 

  6. Breedam AV (2001) Comparing descent heuristics and metaheuristics for the vehicle routing problem. Computers & Operations Research 28(4):289–315

    Article  Google Scholar 

  7. Cordeau JF (2003) Laporte, g.: a tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B:, Methodological 37(6):579–594

    Article  Google Scholar 

  8. Cordeau JF (2006) A branch-and-cut algorithm for the dial-a-ride problem. Oper Res 54(3):573–586

    Article  MathSciNet  Google Scholar 

  9. Cordeau JF, Laporte G (2007) The dial-a-ride problem (darp): Models and algorithms. Annals OR 153:29–46

    Article  Google Scholar 

  10. Garaix T, Artigues C, Feillet D, Josselin D (2011) Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation. Computers & Operations Research 38(10):1435–1442

    Article  MathSciNet  Google Scholar 

  11. Healy P, Moll R (1995) A new extension of local search applied to the dial-a-ride problem. Eur J Oper Res 83(10):83–104

    Article  Google Scholar 

  12. Ho S, Haugland D (2011) Local search heuristics for the probabilistic dial-a-ride problem. OR Spectrum 33:961–988

    Article  MathSciNet  Google Scholar 

  13. Ho SC, Szeto W, Kuo YH, Leung JM, Petering M, Tou TW (2018) A survey of dial-a-ride problems: Literature review and recent developments. Transportation Research Part B:, Methodological 111:395–421

    Article  Google Scholar 

  14. Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14(4):699–719

    Article  MathSciNet  Google Scholar 

  15. Parragh SN, Doerner KF (2010) Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Computers & Operations Research 37(6):1129–1138

    Article  Google Scholar 

  16. Psaraftis HN (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14(2):130–154

    Article  Google Scholar 

  17. Tang K, Wang J, Li X, Yao X (2017) A scalable approach to capacitated arc routing problems based on hierarchical decomposition. IEEE Trans. Cybernetics 47 (11):3928–3940

    Article  Google Scholar 

  18. Watel D, Faye A (2018) Taxi-sharing, Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive. Theor. Comput. Sci. 745:202–223

    Article  MathSciNet  Google Scholar 

  19. Xiang Z, Chu C, Chen H (2006) A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints. Eur J Oper Res 174(2):1117–1139

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the Natural Science Foundation of China under Grant 61806090 , Grant 61672478 and Grant 61602349, in part by the Shenzhen Peacock Plan under Grant KQTD2016112514355531.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Wuhan University of Science and Technology, 430065, Wuhan, China

    Minshi Chen & Jianxun Chen

  2. University Key Laboratory of Evolving Intelligent Systems of Guangdong Province, Department of Computer Science and Engineering, Southern University of Science and Technology, Shenzhen, 518055, China

    Minshi Chen, Peng Yang & Ke Tang

  3. Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System, Wuhan University of Science and Technology, 430065, Wuhan, China

    Minshi Chen & Jianxun Chen

  4. School of Computer Science and Technology, University of Science and Technology of China, Hefei, 230027, China

    Shengcai Liu

Authors
  1. Minshi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jianxun Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peng Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shengcai Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ke Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Jianxun Chen or Ke Tang.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, M., Chen, J., Yang, P. et al. A heuristic repair method for dial-a-ride problem in intracity logistic based on neighborhood shrinking. Multimed Tools Appl 80, 30775–30787 (2021). https://doi.org/10.1007/s11042-020-08894-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-08894-7

Keywords

Search

Navigation