Results 71 to 80 of about 957 (221)

Aggregation formulation for on‐site multidepot vehicle scheduling scenario

Computer-Aided Civil and Infrastructure Engineering, Volume 39, Issue 20, Page 3030-3062, 15 October 2024.
Abstract The multidepot vehicle scheduling problem (MDVSP) is a fundamental public transport challenge. To address the large‐scale model and inherent solution symmetry associated with the traditional trip‐to‐trip connection‐based approach for MDVSP, a new trip‐to‐route (T2R) connection‐based approach is proposed.
Yi Gao, Yuanjie Tang, Rengkui Liu
wiley   +1 more source

Solving Minimum Cost Multi-Commodity Network Flow Problem Using Lexicographic Goal Programming Approach

Journal of Applied Sciences and Environmental Management, 2018
In an urban transport system, a dysfunction often occurred as demand for transportation infrastructure exceeds available supply. The result includes traffic congestion, higher travel time and cost, higher emission of harmful gases and general reduction ...
JO Olusina, OU Nse
doaj   +1 more source

Parametric Based Techno‐Economic Evaluation for a Solar Thermal‐PV Integrated Multi‐Commodity Storage Facility

Energy Storage, Volume 6, Issue 6, September 2024.
ABSTRACT Postharvest losses and spoilage of agricultural products are a major problem for tropical countries, and it is even more challenging for countries encountering fluctuating power shortages, such as Pakistan. Therefore, this study focused on the energy and economic analysis of cold storage to store three products (potatoes, pomegranates, and ...
Malik Shahzaib, Abdul Moeez, Abdul Ghafoor Memon, Laveet Kumar   +3 more
wiley   +1 more source

Multi-Commodity Network Flow Model Applied to Waste Processing Cost Analysis for Producers

Chemical Engineering Transactions, 2015
Supply chain models and network flow models represent a frequent task, where transport of product(s) or service(s) between supplier(s) and consumer(s) is optimized.
R. Šomplák, M. Touš, M. Pavlas, J. Gregor, P. Popela, A. Rychtár   +5 more
doaj   +1 more source

Wildlife reserve design with connectivity and buffer requirements

International Transactions in Operational Research, Volume 31, Issue 4, Page 2231-2246, July 2024.
Abstract This paper deals with the problem of finding the optimal configuration of a network of land parcels connecting and protecting core areas through corridors and buffer areas within budget. We focus on polynomial‐sized integer linear programming formulations, building on previous research and borrowing some ideas from other authors.
Pedro Ferrão Patrício
wiley   +1 more source

Um modelo de fluxo em rede para solução de problemas de distribuição de produtos compostos [PDF]

, 2005
Tese (doutorado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia de Produção.Neste trabalho é proposto um modelo linear de Fluxo em Redes para o problema de minimização de custos de produção e ...
Machado, Catia Maria dos Santos
core  

Modelling and analysis of nuclear reactor system coupled with a liquid metal battery

The Journal of Engineering, Volume 2024, Issue 5, May 2024.
Abstract Traditionally, nuclear power plants in the U.S. provide baseload power to the power grid because they have less flexibility for ramping their output power than natural gas peaking plants. However, achieving climate goals to reduce the consumption of fossil‐based natural gas places pressure on nuclear power plants and other power generators to
Amey Shigrekar, Jiangkai Peng, Temitayo O. Olowu, Fernando Gallego Dias, Tyler Westover   +4 more
wiley   +1 more source

Multicommodity Flow Approximation used for Exact Graph Partitioning

, 2003
We present a fully polynomial-time approximation scheme for a multicommodity flow problem that yields lower bounds of the graph bisection problem.
Larissa Timajev, Meinolf Sellmann, Norbert Sensen   +2 more
core   +1 more source

Multicommodity flows in graphs II

Japanese journal of mathematics. New series, 1984
[For part I see Discrete Appl. Math. 6, 55-62 (1983; Zbl 0509.90030).] Let G be a graph with possibly multiple edges and let \((s_ 1,t_ 1)\), \((s_ 2,t_ 2)\), \((s_ 3,t_ 3)\) be pairs of vertices of G. We prove that if for each \(i=1,2,3\), there exist three edge-disjoint paths between \(s_ i\) and \(t_ i\), then there exist edge-disjoint paths \(P_ 1\)
openaire   +3 more sources

The strong network orientation problem

International Transactions in Operational Research, Volume 31, Issue 1, Page 192-220, January 2024.
Abstract This study presents models and heuristics for solving the strong network orientation problem (SNOP), which can model several tactical optimization problems of setting directions in urban networks. The objective is to set an orientation for each edge in an undirected graph such that the resulting digraph is strongly connected and the total ...
Christophe Duhamel, Andréa Cynthia Santos   +1 more
wiley   +1 more source