{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T22:15:53Z","timestamp":1768083353287,"version":"3.49.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0377-2217(99)00408-7","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"449-468","source":"Crossref","is-referenced-by-count":114,"title":["Vehicle routing\u2013scheduling for waste collection in Hanoi"],"prefix":"10.1016","volume":"125","author":[{"given":"Dang Vu","family":"Tung","sequence":"first","affiliation":[]},{"given":"Anulark","family":"Pinnoi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00408-7_BIB1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1002\/net.3230110204","article-title":"Classification in vehicle routing and scheduling","volume":"11","author":"Bodin","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0305-0548(83)90030-8","article-title":"Routing and scheduling of vehicles and crews: The state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","article-title":"Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation","volume":"20","author":"Christofides","year":"1981","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0377-2217(89)90106-9","article-title":"Vehicles scheduling with sliding time windows","volume":"38","author":"Ferland","year":"1989","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for vehicle routing","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0305-0548(81)90035-6","article-title":"Current and future research directions in network optimization","volume":"8","author":"Golden","year":"1981","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.26.2.69","article-title":"An optimization-based heuristic for vehicle routing and scheduling with soft time windows constraints","volume":"26","author":"Koskosidis","year":"1992","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/trsc.6.2.149","article-title":"A man\u2013machine approach toward solving the generalized truck dispatching problem","volume":"6","author":"Krolak","year":"1972","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(92)90138-Y","article-title":"The TSP: an overview of exact and approximate algorithms","volume":"59","author":"Laporte","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB10","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB11","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1976.95","article-title":"A sequential route-building algorithm applying a generalized savings criterion","volume":"27","author":"Mole","year":"1976","journal-title":"Operations Research Quaterly"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB12","unstructured":"Or, I., 1976. Traveling salesman type combinatorial problems and their relation to the logistics of blood banking. PhD Dissertation. Department of Industrial Engineering and Management Science, Northwestern University, Evanston, IL"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB13","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","article-title":"An exchange heuristic for routing problem with time windows","volume":"46","author":"Potvin","year":"1995","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","article-title":"A tabu search heuristic for the multiple depot VRP","volume":"23","author":"Renaul","year":"1996","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB15","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time windows constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","article-title":"Time windows constrained routing and scheduling problem","volume":"22","author":"Solomon","year":"1988","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB17","unstructured":"Solomon, M.M., Baker, E.K., Schaffer, J.R., 1988. Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures. In: Golden, B.L., Assaad, A.A. (Eds.), Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, pp. 85\u2013105"},{"key":"10.1016\/S0377-2217(99)00408-7_BIB18","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004087?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799004087?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T10:53:19Z","timestamp":1555843999000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799004087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0377221799004087"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00408-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}