Computational experiments with a lazy version of a K quickest simple path ranking algorithm

Pascoal, Marta; Captivo, M. Eugénia; Clímaco, João

doi:10.1007/s11750-007-0033-0

Cited by 12 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A path is considered as feasible if at least a unit of population can complete the transshipment within the planned time horizon. The construction of the lists is performed by adopting the lazy version of the Chen's approach presented in Pascoal et al [2,26] for ranking quickest loopless paths, together with the Yen's algorithm [43]. The utilized method keeps in memory an array of shortest loopless paths, each of them obtained in a specific subgraph of the original graph.…”

Section: Generation Of Candidate Paths and Initial Solutionmentioning

confidence: 99%

“…Extensively treated in the literature it forces the s-t flow to be routed on a single path [2,11]. The problem of k-quickest paths ranking has been addressed by Pascoal et al [2,25,26] and applied to the routing of data packets in Internet networks in Clímaco et al [5]. Melchiori and Sgalambro [6] considered its N P -hard multicommodity variant to solve instances of emergency transportation problems in an evacuation scenario.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem

Melchiori

Sgalambro

2018

Computers & Operations Research

View full text Add to dashboard Cite

The literature on k-splittable flows, see Baier et al. (2002) [1], provides evidence on how controlling the number of used paths enables practical applications of flows optimization in many real-world contexts. Such a modeling feature has never been integrated so far in Quickest Flows, a class of optimization problems suitable to cope with situations such as emergency evacuations, transportation planning and telecommunication systems, where one aims to minimize the makespan, i.e. the overall time needed to complete all the operations, see Pascoal et al. (2006) [2]. In order to bridge this gap, a novel optimization problem, the Quickest Multicommodity k-Splittable Flow Problem (QM CkSF P) is introduced in this paper. The problem seeks to minimize the makespan of transshipment operations for given demands of multiple commodities, while imposing restrictions on the maximum number of paths for each single commodity. The computational complexity of this problem is analyzed, showing its N P-hardness in the strong sense, and an original Mixed-Integer Programming formulation is detailed. We propose a matheuristic algorithm based on a hybridized Very Large-Scale Neighborhood Search that, utilizing the presented mathematical formulation, explores multiple search spaces to solve efficiently large instances of the QM CkSF P. High quality computational results obtained on benchmark test sets are presented and discussed, showing how the proposed matheuristic largely outperforms a state-of-the-art heuristic scheme frequently adopted in path-restricted flow problems.

show abstract

Section: Generation Of Candidate Paths and Initial Solutionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem

Melchiori

Sgalambro

2018

Computers & Operations Research

View full text Add to dashboard Cite

show abstract

“…The session "Shortest Path Routing III" contained a paper on introducing and evaluating reduced cost fixing for network routing [3], another paper on optimizing IP networks with uncertain demands [87], and a third paper on designing IP/OSPF networks [61]. The session "Optimal Paths" contained a paper describing a statistical analysis of the number of nondominated paths in the multiobjective shortest path problem [103], another describing the shortest path problem when the given topology may change [15], another describing a Benders decomposition approach for a shortest path problem with interval data [85], and a fourth one on ranking optimal paths [93]. Finally, the session "Routing in Networks" contained papers on the lexicographically minimum loaded network problem [90], on a routing scheme for changing a shortest path when a link's length changes [116], and on a scheme for sequential rerouting of demands for network resource optimization [69].…”

Section: The Session "Designing Network With Connectivitymentioning

confidence: 99%

Further contributions to network optimization

Ben‐Ameur¹,

Gouveia

2006

Networks

View full text Add to dashboard Cite

show abstract

“…is problem extends for the singlepair QPP to all-pair QPP as shown by the authors in [8]. Several extensions have been made for the QPP as the k-QPP was introduced in [9][10][11][12]. For general network, it is very important to design a routing protocol for high availability so that critical services may get completed.…”

Section: Introductionmentioning

confidence: 99%

A Framework for Risk-Energy Aware Service-Level Agreement Provisioning (RESP) for Computing the Quickest Path

Sharma

Kumar

2019

Journal of Computer Networks and Communications

View full text Add to dashboard Cite

This paper involved the computation of quickest paths with the help of service-level agreement (SLA) and energy constraints. The consideration of these constraints helps to propose a novel system model which computes the path to strengthen the continuity and criticality of the data transmission. The proposed risk-energy aware SLA provisioning (RESP) system model incorporates the research gaps of the existing risk assessment models in the literature without any increase in time complexity. The formulation of RESP shows the usefulness in the critical applications. The results show that the computation of risk-provisioned path gives the SLA satisfied paths and has a great impact of variations in the data traffic. The performance of the proposed algorithm has been indicated in terms of different performance parameters such as mean s−t paths, average hop counts, and average energy efficiency. Simulation result implies that as data traffic increases, the number of the risk‐provisioned s−t paths decreases whereas corresponding average hop counts and average energy efficiency increases.

show abstract

Computational experiments with a lazy version of a K quickest simple path ranking algorithm

Abstract: Graph algorithms, Networks, Quickest path, Ranking, 90C27, 90C35,

Cited by 12 publications

References 9 publications

A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem

A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem

Further contributions to network optimization

A Framework for Risk-Energy Aware Service-Level Agreement Provisioning (RESP) for Computing the Quickest Path

Contact Info

Product

Resources

About