Management Science Seminar: Bi-Criteria Route Planning Problem

Event Date: 30 January 2015

Seminar on 'Bi-Criteria Route Planning Problem' with research assocate Diclehan Tezcaner Ozturk

When: Friday, January 30, 1.30-2.30pm

Where: Room 863 Graham Hills Building

Abstract

We address the route planning problem of a single vehicle under bi-criteria.
We consider a general case for this problem where the vehicle has to visit
several targets and return to the base.

This problem can be considered as a combination of two combinatorial optimization problems. We need to determine the arc to be followed between each target pair. We model this as a bi-criteria shortest path problem. We also need to determine the visiting order of the targets. We model this as a bi-criteria traveling salespersonproblem (BCTSP).

We define the overall problem as a generalized BCTSP. We develop an evolutionary algorithm to approximate the nondominated frontier of this problem. We also develop an interactive algorithm that finds the most preferred solution of a decision maker whose preferences are consistent with a quasiconvex preference function of the two objectives to be minimized. We demonstrate our approaches on the unmanned air vehicle route planning problem.

Published: 27 January 2015