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...
محفوظ في:
المؤلفون الرئيسيون: | VANSTEENWEGEN, Pieter, GUNAWAN, Aldy |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2019
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/sis_research/5093 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Simulated annealing for the multi-vehicle cyclic inventory routing problem
بواسطة: GUNAWAN, Aldy, وآخرون
منشور في: (2019) -
The Multi-Vehicle Cycle Inventory Routing Problem: Formulation and a metaheuristic approach
بواسطة: YU, Vincent F., وآخرون
منشور في: (2021) -
Vehicle routing problem for multi-product cross-docking
بواسطة: GUNAWAN, Aldy, وآخرون
منشور في: (2020) -
A genetic algorithm to minimise number of vehicles in an electric vehicle routing problem
بواسطة: QUECK, Kiian Leong Bertran, وآخرون
منشور في: (2020) -
Time window assignment vehicle routing problem with vehicle restrictions, time dependency and heterogeneous vehicles
بواسطة: Lee, Lance Lindle O., وآخرون
منشور في: (2017)