A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows

Liangjun Ke; Huimin Guo; Qingfu Zhang

doi:10.1109/CEC.2014.6900447

A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows

Liangjun Ke, Huimin Guo, Qingfu Zhang

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

6 Citations (Scopus)

Abstract

The team orienteering problem with time windows (TOPTW) is a well studied routing problem. In this paper, a cooperative algorithm is proposed. It collaborates metaheuristic and branch-and-price. A restricted master problem and subproblem are defined. It uses a heuristic to obtain an integral solution for the restricted master problem and a metaheuristic to generate new columns for the subproblem. Experimental study shows that this algorithm can find new better solutions for several instances in short time, which supports the effectiveness of the cooperative mechanism between metaheuristic and branch-and-price.

Original language	English
Title of host publication	Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014
Publisher	IEEE
Pages	1878-1882
ISBN (Print)	9781479914883
DOIs	https://doi.org/10.1109/CEC.2014.6900447
Publication status	Published - 16 Sept 2014
Event	2014 IEEE Congress on Evolutionary Computation, CEC 2014 - Beijing, China Duration: 6 Jul 2014 → 11 Jul 2014

Conference

Conference	2014 IEEE Congress on Evolutionary Computation, CEC 2014
Place	China
City	Beijing
Period	6/07/14 → 11/07/14

Access Output

10.1109/CEC.2014.6900447

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{64633ac1062f48f29fb109dc2bd8916d,

title = "A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows",

abstract = "The team orienteering problem with time windows (TOPTW) is a well studied routing problem. In this paper, a cooperative algorithm is proposed. It collaborates metaheuristic and branch-and-price. A restricted master problem and subproblem are defined. It uses a heuristic to obtain an integral solution for the restricted master problem and a metaheuristic to generate new columns for the subproblem. Experimental study shows that this algorithm can find new better solutions for several instances in short time, which supports the effectiveness of the cooperative mechanism between metaheuristic and branch-and-price.",

author = "Liangjun Ke and Huimin Guo and Qingfu Zhang",

year = "2014",

month = sep,

day = "16",

doi = "10.1109/CEC.2014.6900447",

language = "English",

isbn = "9781479914883",

pages = "1878--1882",

booktitle = "Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014",

publisher = "IEEE",

address = "United States",

note = "2014 IEEE Congress on Evolutionary Computation, CEC 2014 ; Conference date: 06-07-2014 Through 11-07-2014",

}

Ke, L, Guo, H & Zhang, Q 2014, A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows. in Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014., 6900447, IEEE, pp. 1878-1882, 2014 IEEE Congress on Evolutionary Computation, CEC 2014, Beijing, China, 6/07/14. https://doi.org/10.1109/CEC.2014.6900447

A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows. / Ke, Liangjun; Guo, Huimin; Zhang, Qingfu.
Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014. IEEE, 2014. p. 1878-1882 6900447.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows

AU - Ke, Liangjun

AU - Guo, Huimin

AU - Zhang, Qingfu

PY - 2014/9/16

Y1 - 2014/9/16

N2 - The team orienteering problem with time windows (TOPTW) is a well studied routing problem. In this paper, a cooperative algorithm is proposed. It collaborates metaheuristic and branch-and-price. A restricted master problem and subproblem are defined. It uses a heuristic to obtain an integral solution for the restricted master problem and a metaheuristic to generate new columns for the subproblem. Experimental study shows that this algorithm can find new better solutions for several instances in short time, which supports the effectiveness of the cooperative mechanism between metaheuristic and branch-and-price.

AB - The team orienteering problem with time windows (TOPTW) is a well studied routing problem. In this paper, a cooperative algorithm is proposed. It collaborates metaheuristic and branch-and-price. A restricted master problem and subproblem are defined. It uses a heuristic to obtain an integral solution for the restricted master problem and a metaheuristic to generate new columns for the subproblem. Experimental study shows that this algorithm can find new better solutions for several instances in short time, which supports the effectiveness of the cooperative mechanism between metaheuristic and branch-and-price.

UR - http://www.scopus.com/inward/record.url?scp=84908576827&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84908576827&origin=recordpage

U2 - 10.1109/CEC.2014.6900447

DO - 10.1109/CEC.2014.6900447

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9781479914883

SP - 1878

EP - 1882

BT - Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014

PB - IEEE

T2 - 2014 IEEE Congress on Evolutionary Computation, CEC 2014

Y2 - 6 July 2014 through 11 July 2014

ER -

A cooperative approach between metaheuristic and branch-and-price for the team orienteering problem with time windows

Abstract

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this