Keyword: networks: path

Found 387 papers in total
Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources
Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources
2010,
Effective project management requires the development of a realistic plan and a clear...
A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability
A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability
2008,
The weighted multicommodity multistate unreliable network (WMMUN) is a novel network...
Path-reduced costs for eliminating arcs in routing and scheduling
Path-reduced costs for eliminating arcs in routing and scheduling
2010,
In many branch-and-price algorithms, the column generation pricing problem consists of...
Evaluation of shortest paths in the road network of Sindh-Pakistan
Evaluation of shortest paths in the road network of Sindh-Pakistan
2009,
Optimization is a key factor in almost all the topics of operations research /...
Location and allocation of service units on a congested network
Location and allocation of service units on a congested network
2008,
We consider the problem of locating facilities and allocating servers on a congested...
The route expropriation problem
The route expropriation problem
2008,
This paper considers the problem of selecting obnoxious routes (e.g., routes used to...
The canadian traveller problem and its competitive analysis
The canadian traveller problem and its competitive analysis
2009,
From the online point of view, we study the Canadian Traveller Problem (CTP), in which...
Branch and cut and price for the pickup and delivery problem with time windows
Branch and cut and price for the pickup and delivery problem with time windows
2009,
In the pickup and delivery problem with time windows vehicle routes must be designed...
Minimum work paths in elevated networks
Minimum work paths in elevated networks
2008,
A new variant of the shortest path problem involves a bicycle traveling from an origin...
Minimizing a stochastic maximum-reliability path
Minimizing a stochastic maximum-reliability path
2008,
We consider a stochastic network interdiction problem in which the goal is to detect...
The building evacuation problem with shared information
The building evacuation problem with shared information
2008,
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is...
Network design for time-constrained delivery
Network design for time-constrained delivery
2008,
To meet customer demand, delivery companies are offering an increasing number of...
Dynamic evacuation routes for personnel on a naval ship
Dynamic evacuation routes for personnel on a naval ship
2008,
We propose a dynamic escape route system for emergency evacuation of a naval ship. The...
Constructive complexity: a metric for operations research spreadsheet model design
Constructive complexity: a metric for operations research spreadsheet model design
2008,
This article makes a modest step toward a quantitative measure of the work required to...
A minimum incoming weight label method and its application in CPM networks
A minimum incoming weight label method and its application in CPM networks
2008,
An efficient approach towards finding a directed, shortest path or a directed longest...
A map‐based decision‐support system for delivery planning
A map‐based decision‐support system for delivery planning
2007,
This paper describes a project to develop a map‐based decision‐support...
A shortest-paths heuristic for statistical data protection in positive tables
A shortest-paths heuristic for statistical data protection in positive tables
2007,
National statistical agencies (NSAs) routinely release large amounts of tabular...
Finding the minimum cost path for a railway fare calculation: a case study involving more than one railway company
Finding the minimum cost path for a railway fare calculation: a case study involving more than one railway company
2008,
When calculating the fare between a given pair of stations, the minimum cost path from...
FBP: A frontier-based tree-pruning algorithm
FBP: A frontier-based tree-pruning algorithm
2006,
A frontier–based tree–pruning algorithm (FBP) is proposed. The new method...
The k-path tree matroid and its applications to survivable network design
The k-path tree matroid and its applications to survivable network design
2008,
We define the k -path tree matroid, and use it to solve network design problems in...
Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
2008,
In real road networks, the presence of no-left, no-right or no U-turn signs, restricts...
Approximation of min–max and min–max regret versions of some combinatorial optimization problems
Approximation of min–max and min–max regret versions of some combinatorial optimization problems
2007,
This paper investigates, for the first time in the literature, the approximation of...
Combinatorially simple pickup and delivery paths
Combinatorially simple pickup and delivery paths
2004,
Pickup and delivery problems discussed in the literature are often constrained to...
An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
2007,
This paper describes an exact algorithm for solving a problem where the same vehicle...
Papers per page: