{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,14]],"date-time":"2024-08-14T16:32:26Z","timestamp":1723653146153},"reference-count":10,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4972,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1993,3]]},"abstract":"Abstract<\/jats:title>In this paper, we consider a special case of the time\u2010dependent traveling salesman problem where the objective is to minimize the sum of all distances traveled from the origin to all other cities. Two exact algorithms, incorporating lower bounds provided by a Lagrangean relaxation of the problem, are presented. We also investigate a heuristic procedure derived from dynamic programming that is able to evaluate the distance from optimality of the produced solution. Computational results for a number of problems ranging from 15 to 60 cities are given. They show that problems up to 35 cities can be solved exactly and problems up to 60 cities can be solved within 3% from optimality. \u00a9 1993 by John Wiley & Sons, Inc.<\/jats:italic><\/jats:p>","DOI":"10.1002\/net.3230230202","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T13:49:35Z","timestamp":1178977775000},"page":"81-91","source":"Crossref","is-referenced-by-count":76,"title":["The traveling salesman problem with cumulative costs"],"prefix":"10.1002","volume":"23","author":[{"given":"Lucio","family":"Bianco","sequence":"first","affiliation":[]},{"given":"Aristide","family":"Mingozzi","sequence":"additional","affiliation":[]},{"given":"Salvatore","family":"Ricciardelli","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Dynamic Programming","author":"Bellman R.","year":"1958"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-V"},{"key":"e_1_2_1_4_2","unstructured":"L.Bianco A.Mingozzi andS.Ricciardelli Minimizing mean flowtime with sequence dependent processing times.EURO IX Paris July 6\u20138 1988. IASI Report R.224 (July1988)."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110207"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.4.1018"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200605"},{"key":"e_1_2_1_9_2","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1982"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.86"},{"key":"e_1_2_1_11_2","volume-title":"Machine scheduling problems","author":"Rinnooy Kan A. H. G.","year":"1976"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230230202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230230202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T01:20:25Z","timestamp":1698196825000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230230202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["10.1002\/net.3230230202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230230202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}