{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:25:56Z","timestamp":1759937156944},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766308"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76631-5_103","type":"book-chapter","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T02:33:07Z","timestamp":1193020387000},"page":"1078-1088","source":"Crossref","is-referenced-by-count":6,"title":["DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants"],"prefix":"10.1007","author":[{"given":"Laura","family":"Cruz Reyes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diana M.","family":"Nieto-Y\u00e1\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelson","family":"Rangel-Valdez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Herrera Ortiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Gonz\u00e1lez B","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guadalupe","family":"Castilla Valdez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Francisco","family":"Delgado-Orta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"103_CR1","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem. In: Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2001)","DOI":"10.1137\/1.9780898718515"},{"key":"103_CR2","unstructured":"Pisinger, D., Ropke, S.: A General Heuristic for Vehicle Routing Problems, tech. report, Dept. of Computer Science, Univ. Copenhagen (2005)"},{"key":"103_CR3","unstructured":"OR\/MS Today: Vehicle Routing Software Survey, United States. Institute for Operations Research and the Management Sciences (June 2006)"},{"key":"103_CR4","unstructured":"Cordeau, J.F., Laporte, G., Savelsbergh, M.W.P., Vigo, D.: Short-Haul Routing(submitted)"},{"key":"103_CR5","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Iori, M., Laporte, G., Martello, S.: A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints, Networks (to appear)","DOI":"10.1002\/net.20192"},{"key":"103_CR6","unstructured":"Balgoh, J., B\u00e9k\u00e9si, J., Galambos, G., Reinelt, G.: Lower Bound for The On-line Packing Problem with Restricted Repacking. In: 29th Hungarian Conference of Mathematics, Physics and Computer Science (2005)"},{"key":"103_CR7","unstructured":"Herrera, J.: Development of a methodology based on heuristics for the integral solution of routing, scheduling and loading problems on the distribution and products delivery process. Master\u2019s thesis, Posgrado en Ciencias de la Computaci\u00f3n, Instituto Tecnol\u00f3gico de Ciudad Madero, M\u00e9xico (2006)"},{"key":"103_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0377-2217(02)00247-3","volume":"147","author":"J. Kang","year":"2003","unstructured":"Kang, J., Park, S.: Algorithms for Variable Sized Bin Packing Problem. Proc. Operational Research\u00a0147, 365\u2013372 (2003)","journal-title":"Proc. Operational Research"},{"key":"103_CR9","doi-asserted-by":"crossref","unstructured":"Epstein, L.: Online Bin Parking with Cardinality Constraints. In: Proc. 13th European Symposium on Algorithms (2005)","DOI":"10.1007\/11561071_54"},{"key":"103_CR10","doi-asserted-by":"crossref","unstructured":"Chan, W., Chin, F.Y.L., Ye, D., Zhang, G., Zhang, Y.: Online Bin Parking of Fragile Objects with Application in Cellular Networks, tech. report, Hong Kong RGC Grant HKU5172\/03E (2005)","DOI":"10.1007\/11600930_56"},{"key":"103_CR11","unstructured":"Verweij, B.: Multiple Destination Bin Packing, tech. report, Algorithms and Complexity in Information Technology (1996)"},{"key":"103_CR12","doi-asserted-by":"crossref","unstructured":"Manyem, P.: Bin Packing and Covering with Longest Items at The Bottom: Online Version, ANZIAM J.43 (E), pp. E186\u2013E232, Australia. Mathematical Soc. (2002)","DOI":"10.21914\/anziamj.v43i0.470"},{"key":"103_CR13","unstructured":"Correia, I., Gouveia, L., Saldanha da, G.F.: Solving the Variable Size Bin Packing Problem with Discretized Formulations, Centro de Investigacao Operacional (CIO) - Working Paper (2006)"},{"key":"103_CR14","series-title":"Lectures Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-540-74742-0_9","volume-title":"A Distributed Metaheuristic for Solving a Real-World Scheduling-Routing-Loading Problem","author":"L. Cruz","year":"2007","unstructured":"Cruz, L., Gonz\u00e1lez, J., Romero, D., Fraire, H., Rangel, N., Herrera, J., Arra\u00f1aga, B., Delgado, F.: A Distributed Metaheuristic for Solving a Real-World Scheduling-Routing-Loading Problem. Lectures Notes in Computer Science, vol.\u00a04742, pp. 68\u201377. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","MICAI 2007: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76631-5_103.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T13:13:25Z","timestamp":1684070005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76631-5_103"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766308"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76631-5_103","relation":{},"subject":[]}}