Lancaster EPrints

The time-dependent prize-collecting arc routing problem

Black, Daniel and Eglese, Richard and Wøhlk, Sanne (2013) The time-dependent prize-collecting arc routing problem. Computers and Operations Research, 40 (2). pp. 526-535. ISSN 0305-0548

[img]
Preview
PDF (The time-dependent prize-collecting arc routing problem) - Draft Version
Download (220Kb) | Preview

    Abstract

    A new problem is introduced named the Time-Dependent Prize-Collecting Arc Routing Problem (TDPARP). It is particularly relevant to situations where a transport manager has to choose between a number of full truck load pick-ups and deliveries on a road network where travel times change with the time of day. Two metaheuristic algorithms, one based on Variable Neighborhood Search and one based on Tabu Search, are proposed and tested for a set of benchmark problems, generated from real road networks and travel time information. Both algorithms are capable of finding good solutions, though the VNS approach generally shows better performance.

    Item Type: Article
    Journal or Publication Title: Computers and Operations Research
    Uncontrolled Keywords: Prize-collecting ; Arc routing ; Time-dependent ; Full truck load
    Subjects: H Social Sciences > HB Economic Theory
    Departments: Lancaster University Management School > Management Science
    ID Code: 58900
    Deposited By: ep_importer_pure
    Deposited On: 05 Oct 2012 09:50
    Refereed?: Yes
    Published?: Published
    Last Modified: 18 Mar 2013 11:43
    Identification Number:
    URI: http://eprints.lancs.ac.uk/id/eprint/58900

    Actions (login required)

    View Item