An Adaptive Compromise Programming Method

J Geogr Syst (2013) 15:211–228

DOI 10.1007/s10109-012-0172-1

ORIGINAL ARTICLE

An adaptive compromise programming method

for multi-objective path optimization

Rongrong Li • Yee Leung • Hui Lin • Bo Huang

Received: 3 August 2011 / Accepted: 26 June 2012 / Published online: 13 July 2012

Ó Springer-Verlag 2012

Abstract Network routing problems generally involve multiple objectives which

may conflict one another. An effective way to solve such problems is to generate a

set of Pareto-optimal solutions that is small enough to be handled by a decision

maker and large enough to give an overview of all possible trade-offs among the

conflicting objectives. To accomplish this, the present paper proposes an adaptive

method based on compromise programming to assist decision makers in identifying

Pareto-optimal paths, particularly for non-convex problems. This method can provide an unbiased approximation of the Pareto-optimal alternatives by adaptively

changing the origin and direction of search in the objective space via the dynamic

updating of the largest unexplored region till an appropriately structured Pareto

front is captured. To demonstrate the efficacy of the proposed methodology, a case

study is carried out for the transportation of dangerous goods in the road network of

R. Li (&)

Institute of Space and Earth Information Science,

The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

e-mail: rongrongli@cuhk.edu.hk

Y. Leung

Department of Geography and Resource Management,

Institute of Environment, Energy and Sustainability,

The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

e-mail: yeeleung@cuhk.edu.hk

H. Lin Á B. Huang

Department of Geography and Resource Management,

Institute of Space and Earth Information Science,

The Chinese University of Hong Kong, Shatin, N.T., Hong Kong

e-mail: huilin@cuhk.edu.hk

B. Huang

e-mail: bohuang@cuhk.edu.hk

123

212

R. Li et al.

Hong Kong with the support of geographic...