An Improved Pareto Front for the Non-Linear Multi-Objective Fixed Cost Transportation Problem

In this paper, we investigate a non-linear multi-objective optimization fixed-cost transportation problem (MOFCTP) with multiple modes of transport with given capacities, having two opposing objectives: minimization of the total transportation cost and minimization of the total distribution time. The investigated problem is addressed using a modified NSGA-II, achieved by using a priority-based representation by ranking the allocation of routes based on priority levels rather than directly working with transportation quantities, adapting an efficient priority-based decoding procedure, and integrating into its framework newly developed genetic operators tailored to accommodate multiple modes of transportation. The achieved computational results for the five existing instances from the literature prove that our modified NSGA-II outperforms the current state-of-the-art algorithms for solving the non-linear MOFCTP with multiple modes of transport with given capacities, providing an improved Pareto front.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/cec65147.2025.11042989
Primary Topic
Optimization and Mathematical Programming
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Improved Pareto Front for the Non-Linear Multi-Objective Fixed Cost Transportation Problem

Petrică C. Pop, Adrian Petrovan, V. Pop
Optimization and Mathematical Programming
article

An Improved Pareto Front for the Non-Linear Multi-Objective Fixed Cost Transportation Problem

Petrică C. Pop, Adrian Petrovan, V. Pop
article en

Abstract

In this paper, we investigate a non-linear multi-objective optimization fixed-cost transportation problem (MOFCTP) with multiple modes of transport with given capacities, having two opposing objectives: minimization of the total transportation cost and minimization of the total distribution time. The investigated problem is addressed using a modified NSGA-II, achieved by using a priority-based representation by ranking the allocation of routes based on priority levels rather than directly working with transportation quantities, adapting an efficient priority-based decoding procedure, and integrating into its framework newly developed genetic operators tailored to accommodate multiple modes of transportation. The achieved computational results for the five existing instances from the literature prove that our modified NSGA-II outperforms the current state-of-the-art algorithms for solving the non-linear MOFCTP with multiple modes of transport with given capacities, providing an improved Pareto front.

Technical University of Cluj-Napoca (RO)
Openalex Percentile: Top 84%
Optimization and Mathematical Programming
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.