Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance

Mobarakeh Karimi
  • Function : Author
  • PersonId : 1030367
Massoud Aman
  • Function : Author
  • PersonId : 1030368
Ardeshir Dolati
  • Function : Author
  • PersonId : 1030363

Abstract

Given a network $G(N,\!A,\!C)$ and a directed path $P^0$ from the source node s to the sink node t, an inverse multi-objective shortest path problem is to modify the cost matrix C so that $P^0$ becomes an efficient path and the modification is minimized. In this paper, the modification is measured by the bottleneck type weighted Hamming distance and is proposed an algorithm to solve the inverse problem. Our proposed algorithm can be applied for some other inverse multiobjective problem. As an example, we will mention how the algorithm is used to solve the inverse multi-objective minimum spanning tree problem under the bottleneck type weighted Hamming distance.
Fichier principal
Vignette du fichier
440117_1_En_4_Chapter.pdf (223.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01760645 , version 1 (06-04-2018)

Licence

Attribution

Identifiers

Cite

Mobarakeh Karimi, Massoud Aman, Ardeshir Dolati. Inverse Multi-objective Shortest Path Problem Under the Bottleneck Type Weighted Hamming Distance. 2nd International Conference on Topics in Theoretical Computer Science (TTCS), Sep 2017, Tehran, Iran. pp.34-40, ⟨10.1007/978-3-319-68953-1_4⟩. ⟨hal-01760645⟩
261 View
111 Download

Altmetric

Share

Gmail Facebook X LinkedIn More