{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T04:41:25Z","timestamp":1654144885221},"reference-count":38,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4,1]]},"abstract":"<p>The dial-a-ride problem (DARP), is a variant of the pickup and delivery problem (PDP), consists of designing vehicle routes of n customers transportation requests. The problem arises in many transportation applications, like door-to-door transportation services for elderly and disabled people or in services for patients. This paper consider a static multivehicle DARP, which the objective is to minimize a combined costs of total travel distance, total duration, passengers waiting time, the excess ride time of customers, and the early arrival time while respecting maximum route duration limit, the maximum costumer ride time limit, the capacity and the time window constraint. The authors propose a two-phase scheduling method combined to the tabu search heuristic, for the static multivehicle DARP. Their experimentation report best results for Cordeau Benchmark test problem, compared to reported results.<\/p>","DOI":"10.4018\/ijamc.2014040101","type":"journal-article","created":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T14:39:07Z","timestamp":1410187147000},"page":"1-21","source":"Crossref","is-referenced-by-count":1,"title":["A Two-Phase Scheduling Method Combined to the Tabu Search for the DARP"],"prefix":"10.4018","volume":"5","author":[{"given":"Ali","family":"Lemouari","sequence":"first","affiliation":[{"name":"University of Jijel, Jijel, Algeria"}]},{"given":"Oualid","family":"Guemri","sequence":"additional","affiliation":[{"name":"University of Jijel, Jijel, Algeria"}]}],"member":"2432","reference":[{"key":"ijamc.2014040101-0","doi-asserted-by":"publisher","DOI":"10.1016\/S0360-8352(03)00032-9"},{"key":"ijamc.2014040101-1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A"},{"key":"ijamc.2014040101-2","doi-asserted-by":"publisher","DOI":"10.1080\/03052159808941240"},{"key":"ijamc.2014040101-3","doi-asserted-by":"publisher","DOI":"10.1007\/s11750-007-0009-0"},{"key":"ijamc.2014040101-4","unstructured":"Bergvinsdottir, K. B. (2004). The genetic algorithm for solving the dial-a-ride problem. Master thesis. Informatics and Mathematical Modeling. Technical University of Denmark. Denmark."},{"key":"ijamc.2014040101-5","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1060.0202"},{"key":"ijamc.2014040101-6","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1060.0283"},{"key":"ijamc.2014040101-7","doi-asserted-by":"crossref","unstructured":"Cordeau, J. F., Desaulniers, G., Desrosiers, J., Solomon, M. M., & Soumis, F. (2002). VRP with time windows. In P. Toth, & D. Vigo (Eds.), SIAM Monographs on Discrete Mathematics and Applications, 9, 175\u2013193. Philadelphia, PA: SIAM.","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"ijamc.2014040101-8","doi-asserted-by":"publisher","DOI":"10.1016\/S0191-2615(02)00045-0"},{"key":"ijamc.2014040101-9","first-page":"29","article-title":"The dial-a-ride problem: Models and algorithms. A.","volume":"153","author":"J. F.Cordeau","year":"2007","journal-title":"OR"},{"key":"ijamc.2014040101-10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90319-Q"},{"key":"ijamc.2014040101-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ijamc.2014040101-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.08.048"},{"key":"ijamc.2014040101-13","doi-asserted-by":"crossref","unstructured":"Hernandez-P\u00e9rez, H., & Salazar-Gonzalez, J. J. (2003). The one-commodity pickup-and-delivery travelling salesman problem. In M. J\u00fcnger, G. Reinelt, & G. Rinaldi (Eds.), Combinatorial optimization \u2013 Eureka, you shrink! (LNCS, 2570, pp. 89\u2013104). Springer.","DOI":"10.1007\/3-540-36478-1_10"},{"key":"ijamc.2014040101-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.09.013"},{"key":"ijamc.2014040101-15","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(86)90020-2"},{"key":"ijamc.2014040101-16","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602287"},{"key":"ijamc.2014040101-17","unstructured":"Lacomme, P., Quilliot, A., & Zhao, X. (2008). A heuristic and split procedure for dial-a-ride problems. In EU\/MEeting, Troyes, France."},{"key":"ijamc.2014040101-18","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"ijamc.2014040101-19","first-page":"1721","article-title":"Quality of service in dial-a-ride operations.","volume":"56","author":"J.Paquette","year":"2009","journal-title":"C. I.E."},{"issue":"1","key":"ijamc.2014040101-20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","article-title":"A survey on pickup and delivery problems Part I: Transportation between customers and depot.","volume":"58","author":"S. N.Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"issue":"2","key":"ijamc.2014040101-21","first-page":"81","article-title":"A survey on pickup and delivery problems Part II: Transportation between pickup and delivery locations.","volume":"58","author":"S. N.Parragh","year":"2008","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"ijamc.2014040101-22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.10.003"},{"key":"ijamc.2014040101-23"},{"key":"ijamc.2014040101-24","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-005-5432-5"},{"key":"ijamc.2014040101-25","doi-asserted-by":"crossref","unstructured":"Potvin, J. Y., & Rousseau, J. M. (1992). Constraint-directed search for the advanced request dial-a-ride problem with service quality constraint. Computer Science and Operations Research: New Developments in Their Interfaces, 457\u2013474.","DOI":"10.1016\/B978-0-08-040806-4.50035-6"},{"key":"ijamc.2014040101-26","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.14.2.130"},{"key":"ijamc.2014040101-27","doi-asserted-by":"publisher","DOI":"10.1002\/net.20177"},{"key":"ijamc.2014040101-28","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.4.2.146"},{"key":"ijamc.2014040101-29","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.19.4.378"},{"key":"ijamc.2014040101-30","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.19.4.411"},{"key":"ijamc.2014040101-31","first-page":"745","article-title":"GVR delivers it on time.","author":"J.Tavares","year":"2002","journal-title":"Proceedings of the SEAL02 4th Asia-Pacific Conference on Simulated Evolution And Learning"},{"key":"ijamc.2014040101-32","doi-asserted-by":"publisher","DOI":"10.1145\/952670.952679"},{"key":"ijamc.2014040101-33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1361-8_41"},{"key":"ijamc.2014040101-34","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.31.1.60"},{"key":"ijamc.2014040101-35","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.27.3.298"},{"key":"ijamc.2014040101-36","unstructured":"Wilson, H., Sussman, J., Wang, H., & Higonnet, B. (1971). Scheduling algorithms for dial-a-ride system. Tech. Rep. USL TR-70-13, Urban Systms Laboratory, MIT, Cambridge, MA."},{"key":"ijamc.2014040101-37","unstructured":"Zhao, X. (2011). Algorithmes pour les probl\u00e8mes de tourn\u00e9es \u00e0 la demande. PhD Thesis, University Blaise-pascal, Clermont-Ferrand II."}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=114203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T04:18:59Z","timestamp":1654143539000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijamc.2014040101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,4,1]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2014040101","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,1]]}}}