{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:24Z","timestamp":1750220904685,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":19,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1145\/3368926.3369660","type":"proceedings-article","created":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T13:30:11Z","timestamp":1576848611000},"page":"63-68","source":"Crossref","is-referenced-by-count":0,"title":["Using Metaheuristic for Solving the Resource-Constrained Deliveryman Problem"],"prefix":"10.1145","author":[{"given":"Ha-Bang","family":"Ban","sequence":"first","affiliation":[{"name":"Hanoi University of Science and Technology, Hanoi, Vietnam"}]},{"given":"Duc-Nghia","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Hanoi University of Science and Technology, Hanoi, Vietnam"}]}],"member":"320","reference":[{"key":"key-10.1145\/3368926.3369660-1","doi-asserted-by":"crossref","unstructured":"H.G. Abeledo and G. Fukasawa and R. Pessoa and A. Uchoa, \"The Time dependent Traveling Salesman Problem: Polyhedra and Branch-cut-and price Algorithm\", J. Math. Prog. Comp., 2013; 5 (1): 27--55.","DOI":"10.1007\/s12532-012-0047-y"},{"key":"key-10.1145\/3368926.3369660-2","unstructured":"H.B. Ban, K. Nguyen, M.C. Ngo, and D.N. Nguyen, \"An Efficient Exact Algorithm for Minimum Latency Problem\", J. PI, 2013; 10: 1--8."},{"key":"key-10.1145\/3368926.3369660-3","doi-asserted-by":"crossref","unstructured":"H.B. Ban, \"An Efficient Two-phase Metaheuristic Algorithm for The Time Dependent Traveling Salesman Problem\", J. RAIRO-Operations Research, 2018; 53 (3): 917--935.","DOI":"10.1051\/ro\/2019006"},{"key":"key-10.1145\/3368926.3369660-4","doi-asserted-by":"crossref","unstructured":"A. Lucena, \"Time-dependent Traveling Salesman Problem-the Deliveryman case\", J. Networks, 1990; 20 (6): 753--763.","DOI":"10.1002\/net.3230200605"},{"key":"key-10.1145\/3368926.3369660-5","doi-asserted-by":"crossref","unstructured":"A. Blum, P. Chalasani, D. Coppersmith, W. Pulleyblank, P. Raghavan, and M. Sudan, \"The Minimum Latency Problem\", Proc. STOC, 1994; 163--171.","DOI":"10.1145\/195058.195125"},{"key":"key-10.1145\/3368926.3369660-6","unstructured":"K. Chaudhuri, B. Goldfrey, S. Rao, and K. Talwar, \"Path, Tree and Minimum Latency Tours\", Proc. FOCS, 2003; 36--45."},{"key":"key-10.1145\/3368926.3369660-7","doi-asserted-by":"crossref","unstructured":"M. Fischetti, G. Laporte, S. Martello, \"The Deliveryman Problem and Cumulative Matroids\", J. Oper Res, 1993: 41 (6): 1055--1064.","DOI":"10.1287\/opre.41.6.1055"},{"key":"key-10.1145\/3368926.3369660-8","doi-asserted-by":"crossref","unstructured":"T.A. Feo and M.G.C. Resende, \"Greedy Randomized Adaptive Search Procedures\", J. Global Opt., 1995; 6(2):109--133.","DOI":"10.1007\/BF01096763"},{"key":"key-10.1145\/3368926.3369660-9","doi-asserted-by":"crossref","unstructured":"F. Glover, \"Tabu Search\", J. INFORMS, 1990; 1 (2): 4--32.","DOI":"10.1287\/ijoc.2.1.4"},{"key":"key-10.1145\/3368926.3369660-10","unstructured":"J. J. Dongarra, \"Performance of Various Computers Using Standard Linear Equations Software\", Linpack Benchmark Report, University of Tennessee Computer Science Technical Report, 2013; CS-89-85."},{"key":"key-10.1145\/3368926.3369660-11","unstructured":"O. Martin, S. W. Otto, E. W. Felten, \"Large-step Markov chains for the Traveling Salesman Problem\", J. Complex Systems, 1991; 5 (3): 299--326."},{"key":"key-10.1145\/3368926.3369660-12","doi-asserted-by":"crossref","unstructured":"I. Mendez-Diaz, P. Zabala, A. Lucena, \"A New Formulation for the Traveling Deliveryman Problem\", J. Discret Appl Math, 2008; 156: 3223--3237.","DOI":"10.1016\/j.dam.2008.05.009"},{"key":"key-10.1145\/3368926.3369660-13","doi-asserted-by":"crossref","unstructured":"N. Mladenovic, P. Hansen, \"Variable Neighborhood Search\", J. Operations Research, 1997; 24 (11): 1097--1100.","DOI":"10.1016\/S0305-0548(97)00031-2"},{"key":"key-10.1145\/3368926.3369660-14","doi-asserted-by":"crossref","unstructured":"N. Mladenovic, D. Urosevi, and S. Hanafi, \"Variable Neighborhood Search for the Travelling Deliveryman Problem\", J. 4OR, 2012; 11: 1--17.","DOI":"10.1007\/s10288-012-0212-1"},{"key":"key-10.1145\/3368926.3369660-15","doi-asserted-by":"crossref","unstructured":"A. Salehipour, K. Sorensen, P. Goos, and O.Braysy, \"Efficient GRASP+VND and GRASP+VNS metaheuristics for the Traveling Repairman Problem\", J. Operations Research, 2011; 9 (2): 189--209.","DOI":"10.1007\/s10288-011-0153-0"},{"key":"key-10.1145\/3368926.3369660-16","doi-asserted-by":"crossref","unstructured":"D. S.Johnson, and L. A. McGeoch, \"The Traveling Salesman Problem: A Case Study in Local Optimization in Local Search in Combinatorial Optimization\", E. Aarts and J. K. Lenstra, eds., 1997; 215--310.","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"key-10.1145\/3368926.3369660-17","doi-asserted-by":"crossref","unstructured":"B.Y. Wu, Z.-N. Huang and F.-J. Zhan, \"Exact Algorithms for the Minimum Latency Problem\", Inform. Proc. Letters, 2004; 92 (6): 303--309.","DOI":"10.1016\/j.ipl.2004.09.009"},{"key":"key-10.1145\/3368926.3369660-18","unstructured":"http:\/\/elib.zib.de\/pub\/mp-testdata\/tsp\/tsplib\/tsplib.html."},{"key":"key-10.1145\/3368926.3369660-19","unstructured":"https:\/\/sites.google.com\/a\/soict.hust.edu.vn\/rcdm\/."}],"event":{"number":"10","sponsor":["SOICT, School of Information and Communication Technology - HUST","NAFOSTED, The National Foundation for Science and Technology Development"],"acronym":"SoICT 2019","name":"the Tenth International Symposium","start":{"date-parts":[[2019,12,4]]},"location":"Hanoi, Ha Long Bay, Viet Nam","end":{"date-parts":[[2019,12,6]]}},"container-title":["Proceedings of the Tenth International Symposium on Information and Communication Technology  - SoICT 2019"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368926.3369660","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3369660&ftid=2101253&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:50Z","timestamp":1750203890000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3368926.3369660"}},"subtitle":[],"proceedings-subject":"Information and Communication Technology","short-title":[],"issued":{"date-parts":[[2019]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1145\/3368926.3369660","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}