A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)

Details A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract) A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract)

2009-10-07

arxiv.org/abs/0910.1238v1

EPTCS 5, 2009, pp. 5-11

Computer Science

Artificial Intelligence

Scientific paper

10.4204/EPTCS.5.1

Constrained Optimum Path (COP) problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP). We show that side constraints can easily be added in the model. Computational results show the significance of the approach.

Affiliated with

Also associated with

No associations

Rating

A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36105