{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:32:04Z","timestamp":1783701124380,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540858621","type":"print"},{"value":"9783540858638","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85863-8_56","type":"book-chapter","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T14:33:54Z","timestamp":1221230034000},"page":"481-489","source":"Crossref","is-referenced-by-count":1,"title":["Less Expensive Formulation for a Realistic Routing-Scheduling-Loading Problem (RoSLoP)"],"prefix":"10.1007","author":[{"given":"Juan J.","family":"Gonz\u00e1lez-Barbosa","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laura","family":"Cruz-Reyes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jos\u00e9 F.","family":"Delgado-Orta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"H\u00e9ctor J.","family":"Fraire-Huacuja","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guadalupe","family":"Castilla-Valdez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00edctor J. Sosa","family":"Sosa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"56_CR1","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. SIAM Monographs on Discrete Mathematics and App. Society for Industrial and Applied Mathematics (2000)"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"30","DOI":"10.2307\/1905292","volume":"28","author":"G. Dantzig","year":"1960","unstructured":"Dantzig, G.: On the significance of solving linear programming problems with some integer variables. Econometrica\u00a028, 30\u201344 (1960)","journal-title":"Econometrica"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1090\/S0002-9904-1962-10791-5","volume":"68","author":"J. Edmonds","year":"1962","unstructured":"Edmonds, J.: Covers and packings in family of sets. Bull. Amer. Math. Soc.\u00a068, 494\u2013499 (1962)","journal-title":"Bull. Amer. Math. Soc."},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Dantzig, G., et al.: All shortest routes from a fixed origin in a graph. In: Theory of Graphs: International Symposium, Gordon and Breach, pp. 85\u201390 (1967)","DOI":"10.21236\/AD0646552"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Cruz, L., et al.: An Ant Colony System to solve Routing Problems applied to the delivery of bottled products. In: An, A. (ed.), pp. 68\u201377. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-68123-6_36"},{"key":"56_CR6","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1287\/opre.5.2.266","volume":"5","author":"G. Dantzig","year":"1957","unstructured":"Dantzig, G.: Discrete-variable extremum problems. Operation Research\u00a05, 266\u2013277 (1957)","journal-title":"Operation Research"},{"key":"56_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"40 Conf. on Principles and Practice of Constraint Programming","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M. (ed.) 40 Conf. on Principles and Practice of Constraint Programming, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"56_CR8","unstructured":"Cordeau, F., et al.: The VRP with time windows. Technical Report Cahiers du GERAD G-99-13, Ecole des Hautes Etudes Commerciales de Montreal (1999)"},{"key":"56_CR9","unstructured":"Mingozzi, A.: An exact Algorithm for Period and Multi-Depot Vehicle Routing Problems. Department of Mathematics, University of Bologna, Bologna, Italy (2003)"},{"key":"56_CR10","unstructured":"Archetti, C.: The Vehicle Routing Problem with capacity 2 and 3, General Distances and Multiple Customer Visits. Operational Research in Land and Resources Manangement, 102 (2001)"},{"key":"56_CR11","unstructured":"Thangiah, S.: A Site Dependent Vehicle Routing Problem with Complex Road Constraints. Artificial Intelligence and Robotics Lab., Slippery Rock University, U.S.A (2003)"},{"key":"56_CR12","unstructured":"Dorronsoro, B.: The VRP Web. AUREN. Language and Computation Sciences of the University of Malaga (2005), http:\/\/neo.lcc.uma.es\/radi-aeb\/WebVRP"},{"key":"56_CR13","unstructured":"Bianchi, L.: Notes on Dynamic Vehicle Routing. Technical Report IDSIA - Institut Dalle Molle di Studi sull\u2019Intelligenza Artificiale, Switzerland (2000)"},{"key":"56_CR14","unstructured":"Jacobs, B., Goetshalckx, M.: The Vehicle Routing Problem with Backhauls: Properties and Solution Algorithms. Techincal report MHRC-TR-88-13, Georgia Institute of Technology (1993)"},{"key":"56_CR15","unstructured":"Fleischmann, B.: The Vehicle routing problem with multiple use of vehicles. Working paper, Fachbereigh Wirtschafts wissens chaften, Universitt Hamburg (1990)"},{"key":"56_CR16","unstructured":"Taillard, E.: A Heuristic Column Generation Method for the Heterogeneous Fleet VRP. Institut Dalle Moli di Studi sull Inteligenza Artificiale, Switzerland. CRI-96-03 (1996)"},{"key":"56_CR17","unstructured":"Toth, P., Vigo, D.: An Overview of Vehicle Routing Problems. SIAM Monographs on Discrete Mathematics and Applications. The Vehicle Routing Problem (2000)"},{"key":"56_CR18","volume-title":"Computers and Intractability, a Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)"},{"key":"56_CR19","volume-title":"Computer Algorithms, Introduction to Design and Analysis","author":"S. Baase","year":"1998","unstructured":"Baase, S.: Computer Algorithms, Introduction to Design and Analysis. Editorial Addison-Wesley Publishing Company, Reading (1998)"},{"key":"56_CR20","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":"56_CR21","doi-asserted-by":"crossref","unstructured":"Epstein, L.: Online Bin Packing with Cardinality Constraints. In: Proc. 13th European Symposium on Algorithms (2005)","DOI":"10.1007\/11561071_54"},{"key":"56_CR22","unstructured":"Cruz, L., et al.: DiPro: An Algorithm for the Packing in Product Transportation Problems with Multiple Loading and Routing Variants. In: Gelbukh, A., Morales, A.F.K. (eds.), pp. 1078\u20131088. Springer, Heidelberg (2007)"},{"key":"56_CR23","doi-asserted-by":"crossref","unstructured":"Chan, W., et al.: Online Bin Packing of Fragile Objects with Application in Cellular Networks, tech. report, Hong Kong RGC Grant HKU5172\/03E (2005)","DOI":"10.1007\/11600930_56"},{"key":"56_CR24","unstructured":"Verweij, B.: Multiple Destination Bin Packing, tech. report, Algorithms and Complexity in Information Technology (1996)"},{"key":"56_CR25","unstructured":"Herrera, J.: Development of a methodology based on heuristics for the integral solution of routing, scheduling and loading problems on distribution and delivery processes of products. MS. thesis. Instituto Tecnol\u00f3gico de Ciudad Madero, M\u00e9xico (2006)"},{"key":"56_CR26","first-page":"137","volume":"35","author":"J. Delgado","year":"2008","unstructured":"Delgado, J., et al.: Construction of an optimal solution for a Real-World Routing-Scheduling-Loading Problem. Journal Research in Computing Science\u00a035, 137\u2013146 (2008)","journal-title":"Journal Research in Computing Science"}],"container-title":["Advances in Soft Computing","International Symposium on Distributed Computing and Artificial Intelligence 2008 (DCAI 2008)"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85863-8_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:35:36Z","timestamp":1606185336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85863-8_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540858621","9783540858638"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85863-8_56","relation":{},"ISSN":["1615-3871","1860-0794"],"issn-type":[{"value":"1615-3871","type":"print"},{"value":"1860-0794","type":"electronic"}],"subject":[]}}