Courier problems

Authors:
Malay Bhattacharyya
Affiliations:
-
Venue:
Crossroads
Year:
2009

Citing 5
Cited 0

Discrete optimization in public rail transport

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem

Journal of the ACM (JACM)
Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)

Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation)
Finding an optimal tooth color match

Crossroads
COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS

Cybernetics and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Courier problems comprise a set of recently proposed combinatorial optimization problems, which are inspired by some novel requirements in railway wagon scheduling. In these problems, scheduling strategies of some mobile couriers are considered. These mobile couriers initially reside at some fixed location. They are assigned some duties of commodity transfer between different pairs of locations. The scenario may be static or dynamic. The motivation is to optimize the movement of the couriers over the constraint of the traversed path or the associated cost. We discuss here some varieties of the courier problems formalized on graphs and address the potential methods of their solution.