Orienteering problems: Models and algorithms for vehicle routing problems with profits
This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problem...
Saved in:
Main Authors: | VANSTEENWEGEN, Pieter, GUNAWAN, Aldy |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2019
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/5093 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Simulated annealing for the multi-vehicle cyclic inventory routing problem
by: GUNAWAN, Aldy, et al.
Published: (2019) -
The Multi-Vehicle Cycle Inventory Routing Problem: Formulation and a metaheuristic approach
by: YU, Vincent F., et al.
Published: (2021) -
Vehicle routing problem for multi-product cross-docking
by: GUNAWAN, Aldy, et al.
Published: (2020) -
Time window assignment vehicle routing problem with vehicle restrictions, time dependency and heterogeneous vehicles
by: Lee, Lance Lindle O., et al.
Published: (2017) -
A genetic algorithm to minimise number of vehicles in an electric vehicle routing problem
by: QUECK, Kiian Leong Bertran, et al.
Published: (2020)