scholarly journals Combinatorial programming, statistical optimization and the optimal transportation network problem

1982 ◽  
Vol 16 (2) ◽  
pp. 89-124 ◽  
Author(s):  
Marc Los ◽  
Christian Lardinois
Keyword(s):  
Transportation Network ◽  
Statistical Optimization ◽  
Optimal Transportation ◽  
Network Problem ◽  
Combinatorial Programming

scholarly journals Modeling of Mono-Commodity Multi-Location Linear Programming Techniques for Determining Optimum Transportation Network of a Manufacturing Industry

2021 ◽  
Vol 8 (12) ◽  
pp. 145-158
Author(s):  
ADEDEJI, Kasali Aderinmoye ◽  
ZOSU, Segbenu Joseph ◽  
DUDUYEMI Oladejo Samuel
Keyword(s):  
Linear Programming ◽  
Manufacturing Industry ◽  
Transportation Network ◽  
Transportation Cost ◽  
Optimal Transportation ◽  
Location Model ◽  
Transportation Model ◽  
Programming Techniques ◽  
Two Phases

This research on Modeling and Application of Mono-Commodity Multi-Location Linear Programming Techniques For Determining Optimum Transportation Network was carried out at a Manufacturing Industry in Lagos, which comprises of two plants, three depots and twenty retailers axis. The model was analyzed using Micro Soft Excel Software. The analysis to determine the optimal transportation network was carried out in two phases by considering numbers of truckload transported and each commodity from plants to depots and depots to retailers and their optimals. It was discovered that the existing practices transportation cost for truckloads moving from plant to retailers is N3,544,000,000,000 and when optimized, cost is N1,932,650,000,000 while considering each product the optimized transportation cost is N1,871,065,369,000. This implies that the transportation network generated considering each product will yield 47.2% gain in profit than existing network. Hence, it is recommended that mono-commodity multi-location transportation network be used. Keywords: [EXCEL Software, Mono-Commodity Multi-Location Model, Transportation Cost, Transportation Model, Transportation Network.].

A New Multi-Objective Firework Algorithm to Solve the Multimodal Planning Network Problem

2020 ◽  
Vol 11 (4) ◽  
pp. 91-113
Author(s):  
Mouna Gargouri Mnif ◽  
Sadok Bouamama
Keyword(s):  
Optimization Problems ◽  
Transportation Network ◽  
Search Space ◽  
Search Technique ◽  
Multimodal Transportation ◽  
New Approach ◽  
Multi Objective ◽  
Network Problem ◽  
Complex Optimization ◽  
Stochastic Search Technique

This article introduces a new approach called multi-objective firework algorithm (MFWA). The proposed approach allows for solving the multimodal transportation network problem (MTNP). The main goal is to develop a decision system that optimizes and determines the planning network of the multimodal transportation (PNMT) problem. The optimization involves reaching the efficient transport mode and multimodal path, in order to move from one country to another while satisfying the set of objectives. Moreover, the firework algorithm has distinct advantages in solving complex optimization problems and in obtaining a solution by a distributed and oriented research system. This approach presents a search way, which is different from the swarm intelligence-based stochastic search technique. For each firework, the process starts by exploding a firework in the sky. The search space is filled with a shower of sparks to get diversity solutions. This new approach proves their efficacy in solving the multi-objective problem, which is shown by the experimental results.

Sign in / Sign up

Export Citation Format

Share Document