The shared customer collaboration vehicle routing problem
| Autor: | Elena Fernández, Mireia Roca-Riu, M. Grazia Speranza |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa, Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Mathematical optimization
Carriers collaboration Information Systems and Management General Computer Science Operations research Matemàtiques i estadística::Investigació operativa::Programació matemàtica [Àrees temàtiques de la UPC] Computer science 0211 other engineering and technologies 02 engineering and technology 90 Operations research mathematical programming::90C Mathematical programming [Classificació AMS] Management Science and Operations Research Investigació operativa Matemàtiques i estadística::Investigació operativa [Àrees temàtiques de la UPC] Industrial and Manufacturing Engineering Mixed integer programming Vehicle routing problem 0502 economics and business 90 Operations research mathematical programming::90B Operations research and management science [Classificació AMS] Customer collaboration Programació (Matemàtica) Integer programming Service (business) 050210 logistics & transportation 021103 operations research Programming (Mathematics) 05 social sciences Branch-and-cut algorithm Urban logistics Modeling and Simulation Work (electrical) Order (business) Benchmark (computing) |
| Zdroj: | UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) Recercat. Dipósit de la Recerca de Catalunya instname |
| Popis: | This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of service for more than one carrier. The problem, called Shared Customer Collaboration Vehicle Routing Problem, aims at reducing the overall operational cost in a collaboration framework among the carriers for the service of the shared customers. Alternative mathematical programming formulations are proposed for the problem that are solved with a branch-and-cut algorithm. Computational experiments on different sets of benchmark instances are run to assess the effectiveness of the formulations. Moreover, in order to estimate the savings coming from the collaboration, the optimal solutions are compared with the solutions obtained when carriers work independently from each other. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|