Similar Search Results

Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions

Murthy, Ishwar; Sarkar, Sumit - In: Management Science 44 (1998) 11-Part-2, pp. 125-125

This paper considers a stochastic shortest path problem where the arc lengths are independent random variables following a normal distribution. In this problem, the optimal path is one that maximizes the expected utility, with the utility function being piecewise-linear and concave. Such a...

Persistent link: https://www.econbiz.de/10009189599

An Optimization Model for the Simultaneous Operational Flight and Pilot Scheduling Problem

Mirela Stojkovi\'{c}; Soumis, François - In: Management Science 47 (2001) 9, pp. 1290-1305

linear time costs are solved by a specialized dynamic-programming algorithm. The proposed optimization approach has been …

Persistent link: https://www.econbiz.de/10009191858

Determining the best evolution path for export industries using product spaces

Buenafe, Cyrus Paolo M. - In: Philippine Review of Economics 45 (2008) 1, pp. 49-56

graph theory literature. A concept on a typical probability graph was defined and a shortest-path algorithm was formulated …

Persistent link: https://www.econbiz.de/10008677451

Solving the shortest path tour problem

Festa, P.; Guerriero, F.; Laganà, D.; Musmanno, R. - In: European Journal of Operational Research 230 (2013) 3, pp. 464-474

In this paper, we study the shortest path tour problem in which a shortest path from a given origin node to a given destination node must be found in a directed graph with non-negative arc lengths. Such path needs to cross a sequence of node subsets that are given in a fixed order. The subsets...

Persistent link: https://www.econbiz.de/10011052440

Optimal ship navigation with safety distance and realistic turn constraints

Ari, Ibrahim; Aksakalli, Vural; Aydogˇdu, Volkan; Kum, … - In: European Journal of Operational Research 229 (2013) 3, pp. 707-717

lattice discretization and utilization of the A∗ algorithm. We explicitly account for the following three conditions as part …

Persistent link: https://www.econbiz.de/10011052487

A capacitated network flow optimization approach for short notice evacuation planning

Lim, Gino J.; Zangeneh, Shabnam; Reza Baharnemati, M.; … - In: European Journal of Operational Research 223 (2012) 1, pp. 234-245

Scheduling Algorithm (ESA) to expedite the solution process. ESA utilizes Dijkstra’s algorithm for finding the evacuation paths … and a greedy algorithm for finding the maximum flow of each path and the schedule to execute the flow for each time … ESA over an exact algorithm (CCEP) in computation time by running up to 41,682 faster than CCEP. In many test network …

Persistent link: https://www.econbiz.de/10011052510

A temporal ant colony optimization approach to the shortest path problem in dynamic scale-free networks

Yu, Feng; Li, Yanjun; Wu, Tie-Jun - In: Physica A: Statistical Mechanics and its Applications 389 (2010) 3, pp. 629-636

a temporal ant colony optimization (TACO) algorithm is proposed for searching for the shortest paths in the network. The … convergence and the setup for some important parameters of the TACO algorithm are discussed through theoretical analysis and … computer simulations, validating the effectiveness of the proposed algorithm. …

Persistent link: https://www.econbiz.de/10011062988

Sampling social networks using shortest paths

Rezvanian, Alireza; Meybodi, Mohammad Reza - In: Physica A: Statistical Mechanics and its Applications 424 (2015) C, pp. 254-268

In recent years, online social networks (OSN) have emerged as a platform of sharing variety of information about people, and their interests, activities, events and news from real worlds. Due to the large scale and access limitations (e.g., privacy policies) of online social network services...

Persistent link: https://www.econbiz.de/10011194027

Nonsequential appointment scheduling with a random number of requests

Zhu, Yan; Liu, Zhixin; Qi, Xiangtong - In: Production and operations management : the flagship … 33 (2024) 1, pp. 184-204

Persistent link: https://www.econbiz.de/10014575548

Core and Bargaining Set of Shortest Path Games

Grahn, Sofia - 2001

In this paper it is shown that the core and the bargaining sets of Davis-Maschler and Zhou coincide in a class of …

Persistent link: https://www.econbiz.de/10010321813