{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:35:54Z","timestamp":1761597354260,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T00:00:00Z","timestamp":1332720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,26]]},"DOI":"10.1145\/2245276.2245419","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T13:03:31Z","timestamp":1339419811000},"page":"749-754","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Mechanism design for decentralized vehicle routing problem"],"prefix":"10.1145","author":[{"given":"Mohammed","family":"Saleh","sequence":"first","affiliation":[{"name":"Concordia University, Montreal, QC, Canada"}]},{"given":"Andrei","family":"Soeanu","sequence":"additional","affiliation":[{"name":"Concordia University, Montreal, QC, Canada"}]},{"given":"Sujoy","family":"Ray","sequence":"additional","affiliation":[{"name":"Concordia University, Montreal, QC, Canada"}]},{"given":"Mourad","family":"Debbabi","sequence":"additional","affiliation":[{"name":"Concordia University, Montreal, QC, Canada"}]},{"given":"Jean","family":"Berger","sequence":"additional","affiliation":[{"name":"Defence Research & Development Canada-Valcartier, Val-Belair, QC, Canada"}]},{"given":"Abdeslem","family":"Boukhtouta","sequence":"additional","affiliation":[{"name":"Defence Research & Development Canada-Valcartier, Val-Belair, QC, Canada"}]}],"member":"320","published-online":{"date-parts":[[2012,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.1258"},{"key":"e_1_3_2_1_2_1","volume-title":"Networks with the smallest average distance and the largest average clustering. In arXiv, q-bio.MN","author":"Barmpoutis D.","year":"2010","unstructured":"D. Barmpoutis and R. M. Murray . Networks with the smallest average distance and the largest average clustering. In arXiv, q-bio.MN , 2010 . D. Barmpoutis and R. M. Murray. Networks with the smallest average distance and the largest average clustering. In arXiv, q-bio.MN, 2010."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"e_1_3_2_1_4_1","unstructured":"DEIS - OR Group. VRPLIB. www.or.deis.unibo.it\/research_pages\/ORinstances\/VRPLIB\/VRPLIB.html.  DEIS - OR Group. VRPLIB. www.or.deis.unibo.it\/research_pages\/ORinstances\/VRPLIB\/VRPLIB.html."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.80.1275"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.4.626"},{"key":"e_1_3_2_1_8_1","volume-title":"Market trends: Transportation management systems worldwide","author":"Tech Gartner","year":"2007","unstructured":"Gartner Tech . Rep. Market trends: Transportation management systems worldwide , 2007 --2012, 2008. www.gartner.com\/it\/page.jsp?id=812112. Gartner Tech. Rep. Market trends: Transportation management systems worldwide, 2007--2012, 2008. www.gartner.com\/it\/page.jsp?id=812112."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00100-2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The vehicle routing problem: latest advances and new challenges. Operations research\/Computer science interfaces series, 43","author":"Golden B.","year":"2008","unstructured":"B. Golden , S. Raghavan , and E. A. Wasil . The vehicle routing problem: latest advances and new challenges. Operations research\/Computer science interfaces series, 43 . Springer , 2008 . B. Golden, S. Raghavan, and E. A. Wasil. The vehicle routing problem: latest advances and new challenges. Operations research\/Computer science interfaces series, 43. Springer, 2008."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/129194"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"e_1_3_2_1_13_1","first-page":"2","article-title":"The multi-depot vehicle routing problem: A one-stage approach","author":"Lim A.","year":"2005","unstructured":"A. Lim and F. Wang . The multi-depot vehicle routing problem: A one-stage approach . IEEE Transactions on Automation Science and Engineering , 2 , 2005 . A. Lim and F. Wang. The multi-depot vehicle routing problem: A one-stage approach. IEEE Transactions on Automation Science and Engineering, 2, 2005.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"e_1_3_2_1_14_1","volume-title":"Microeconomic Theory","author":"Mas-Colell A.","year":"1995","unstructured":"A. Mas-Colell , M. Whinston , and J. R. Green . Microeconomic Theory . Oxford University Press , 1995 . A. Mas-Colell, M. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, 1995."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of the 2003 IEEE Int. Symposium on Intellignet Control","author":"Miyamoto T.","year":"2003","unstructured":"T. Miyamoto , K. Nakatyou , and S. Kumagai . Agent based planning method for an on-demand transportation system . In Proceedings of the 2003 IEEE Int. Symposium on Intellignet Control , 2003 . T. Miyamoto, K. Nakatyou, and S. Kumagai. Agent based planning method for an on-demand transportation system. In Proceedings of the 2003 IEEE Int. Symposium on Intellignet Control, 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e88-a.11.3036"},{"key":"e_1_3_2_1_17_1","volume-title":"Univesity of Pennsylvania","author":"Parkes D. C.","year":"2001","unstructured":"D. C. Parkes . Chapter 2 : iterative combinatorial auctions: Achieving economic and computational efficiency. PhD thesis , Univesity of Pennsylvania , 2001 . D. C. Parkes. Chapter 2: iterative combinatorial auctions: Achieving economic and computational efficiency. PhD thesis, Univesity of Pennsylvania, 2001."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/090749347"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICAL.2011.6024686"},{"key":"e_1_3_2_1_20_1","first-page":"1","volume-title":"An overview of vehicle routing problems","author":"Toth P.","year":"2001","unstructured":"P. Toth and D. Vigo . An overview of vehicle routing problems . pages 1 -- 26 , 2001 . P. Toth and D. Vigo. An overview of vehicle routing problems. pages 1--26, 2001."}],"event":{"name":"SAC 2012: ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Trento Italy","acronym":"SAC 2012"},"container-title":["Proceedings of the 27th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2245276.2245419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2245276.2245419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:02Z","timestamp":1750243922000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2245276.2245419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,26]]},"references-count":19,"alternative-id":["10.1145\/2245276.2245419","10.1145\/2245276"],"URL":"https:\/\/doi.org\/10.1145\/2245276.2245419","relation":{},"subject":[],"published":{"date-parts":[[2012,3,26]]},"assertion":[{"value":"2012-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}