Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

57.066 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • GNOM - Grup d'Optimització Numèrica i Modelització
  • Articles de revista
  • View Item
  •   DSpace Home
  • E-prints
  • Grups de recerca
  • GNOM - Grup d'Optimització Numèrica i Modelització
  • Articles de revista
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem

Thumbnail
View/Open
COR-D-17-00795R1.pdf (686,8Kb)
Share:
 
 
10.1016/j.cor.2018.05.021
 
  View Usage Statistics
Cita com:
hdl:2117/123216

Show full item record
Archetti, Claudia
Fernández Aréizaga, ElenaMés informacióMés informació
Huerta Muñoz, Diana LuciaMés informacióMés informació
Document typeArticle
Defense date2018-11-01
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
The Flexible Periodic Vehicle Routing Problem is the problem of visiting a given set of customers considering a certain periodicity to attend their demands. It is a generalization of the Periodic Vehicle Routing Problem where the fixed schedule constraint is relaxed and the quantity to deliver to each customer at each visit is a decision variable. This flexibility leads to remarkable savings in total costs and this explains the interest in studying the problem and developing effective solution approaches. In this work, an iterative two-phase matheuristic is developed to solve medium and large instances of the problem. Computational tests are made on benchmark instances and on newly generated instances. The results of the matheuristic are compared to the best-known solutions, on small-size instances, and to lower bounds on larger instances. Computational results show that good quality solutions are obtained in a reasonable amount of time.
CitationArchetti, C., Fernandez, E., Huerta, D. A two-phase solution algorithm for the Flexible Periodic Vehicle Routing Problem. "Computers & operations research", 1 Novembre 2018, vol. 99, p. 27-37. 
URIhttp://hdl.handle.net/2117/123216
DOI10.1016/j.cor.2018.05.021
ISSN0305-0548
Publisher versionhttps://www.sciencedirect.com/science/article/pii/S0305054818301448
Collections
  • GNOM - Grup d'Optimització Numèrica i Modelització - Articles de revista [96]
  • Departament d'Estadística i Investigació Operativa - Articles de revista [604]
Share:
 
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
COR-D-17-00795R1.pdf686,8KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Inici de la pàgina