{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T22:44:53Z","timestamp":1775947493944,"version":"3.50.1"},"reference-count":27,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Transportation Science"],"published-print":{"date-parts":[[2006,5]]},"abstract":"<jats:p> The vehicle routing problem with simultaneous distribution and collection (VRPSDC) is the variation of the capacitated vehicle routing problem that arises when the distribution of goods from a depot to a set of customers and the collection of waste from the customers to the depot must be performed by the same vehicles of limited capacity and the customers can be visited in any order. We study how the branch-and-price technique can be applied to the solution of this problem and in particular we compare two different ways of solving the pricing subproblem: exact dynamic programming and state space relaxation. By applying a bidirectional search we experimentally prove its effectiveness in solving the subproblem. We also devise suitable branching strategies for both the exact and the relaxed approach and we report on an extensive set of computational experiments on benchmark instances with both simple and composite demands. <\/jats:p>","DOI":"10.1287\/trsc.1050.0118","type":"journal-article","created":{"date-parts":[[2006,5,9]],"date-time":"2006-05-09T14:40:54Z","timestamp":1147185654000},"page":"235-247","source":"Crossref","is-referenced-by-count":150,"title":["A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection"],"prefix":"10.1287","volume":"40","author":[{"given":"Mauro","family":"Dell\u2019Amico","sequence":"first","affiliation":[{"name":"Dipartimento di Scienze e Metodi per l\u2019Ingegneria, Universit\u00e0 di Modena e Reggio Emilia, Viale Allegri, 13 42100 Reggio Emilia, Italy"}]},{"given":"Giovanni","family":"Righini","sequence":"additional","affiliation":[{"name":"Dipartimento di Tecnologie dell\u2019Informazione, Universit\u00e0 degli Studi di Milano, via Bramante 65, 26013 Crema, Italy"}]},{"given":"Matteo","family":"Salani","sequence":"additional","affiliation":[{"name":"Dipartimento di Tecnologie dell\u2019Informazione, Universit\u00e0 degli Studi di Milano, via Bramante 65, 26013 Crema, Italy"}]}],"member":"109","reference":[{"key":"B1","volume-title":"Network Flows","author":"Ahuja R. K.","year":"1993"},{"key":"B2","first-page":"249","volume-title":"Lecture Notes in Economics and Mathematical Systems","author":"Angelelli E.","year":"2002"},{"key":"B3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.28.5.1130"},{"key":"B4","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190402"},{"key":"B5","author":"Bianchessi N.","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"B6","first-page":"127","volume-title":"Vehicle Routing: Methods and Studies","author":"Casco D. O.","year":"1988"},{"key":"B7","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110207"},{"key":"B8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5755-5_3"},{"key":"B9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.2.342"},{"key":"B10","doi-asserted-by":"publisher","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"B11","doi-asserted-by":"publisher","DOI":"10.1007\/PL00013346"},{"key":"B12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.42.5.977"},{"key":"B13","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00213-1"},{"key":"B14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.38.5.922"},{"key":"B15","first-page":"216","volume-title":"Networks","volume":"44","author":"Feillet D.","year":"2004"},{"key":"B16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"B17","unstructured":"G\u00e9linas S., Desrochers M., Desrosiers J., Solomon M. M. A new branching strategy for time constrained routing problems with application to backhauling.  (1992) (Cahiers du GERAD G-92-13, HEC Montr\u00e9al, Canada)"},{"key":"B18","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(89)90057-X"},{"key":"B19","volume-title":"Proc. 21st Annual Meeting S.E.TIMS","author":"Golden B.","year":"1985"},{"key":"B20","unstructured":"Irnich S., Villeneuve D. The shortest path problem with resource constraints and k-cycle elimination for k \u2265 3.  (2003) (Cahiers du GERAD G-2003-55, HEC Montr\u00e9al, Canada)"},{"key":"B21","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.33.3.315"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.31.4.372"},{"key":"B24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00086-1"},{"key":"B25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718515"},{"key":"B26","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(96)00033-8"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(02)00056-7"},{"key":"B28","volume-title":"Integer Programming","author":"Wolsey L.","year":"1998"}],"container-title":["Transportation Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/trsc.1050.0118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T19:52:18Z","timestamp":1680465138000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/trsc.1050.0118"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["10.1287\/trsc.1050.0118"],"URL":"https:\/\/doi.org\/10.1287\/trsc.1050.0118","relation":{},"ISSN":["0041-1655","1526-5447"],"issn-type":[{"value":"0041-1655","type":"print"},{"value":"1526-5447","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5]]}}}