A selective-discrete particle swarm optimization algorithm for solving a class of orienteering problems

A selective-discrete particle swarm optimization algorithm for solving a class of orienteering problems

This study addresses a class of NP-hard problem called the Orienteering Problem (OP), which belongs to a well-known class of vehicle routing problems. In the OP, a set of nodes that associated with a location and a score is given. The time required to travel between each pair of nodes is known in ad...

Full description

Saved in:
Bibliographic Details
Main Authors: GUNAWAN, Aldy, YU, Vincent F., REDI, Perwira, JEWPANYA, Parida, LAU, Hoong Chuin
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2017
Subjects:
Orienteering Problem
Optimization
algorithms
Artificial Intelligence and Robotics
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/3892
https://ink.library.smu.edu.sg/context/sis_research/article/4894/viewcontent/MISTA_2017_paper_51.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/3892
https://ink.library.smu.edu.sg/context/sis_research/article/4894/viewcontent/MISTA_2017_paper_51.pdf

Similar Items