Results 51 to 60 of about 108,421 (273)

A Heavy‐Duty Vehicle Routing Problem With Temperature Constraints

open access: yesNetworks, EarlyView.
ABSTRACT This article studies a vehicle routing problem involving a fleet of heavy‐duty vehicles and pickup‐and‐delivery requests for crude items that are both heavy and high‐temperature. The objective is to route the fleet in such a way that maximizes resource efficiency and operational efficiency while simultaneously avoiding thermal overload of any ...
Biljana Roljić, Yuan Chen
wiley   +1 more source

Smart Waste, Smarter World: Exploring Waste Types, Trends, and Tech‐Driven Valorization Through Artificial Intelligence, Internet of Things, and Blockchain

open access: yesSustainable Development, EarlyView.
ABSTRACT Global municipal solid waste generation is projected to exceed 3.8 billion tonnes annually by 2050. This makes the need for smart, inclusive, and scalable waste valorization systems more urgent than ever. This review critically explores the shift from conventional waste management to intelligent, technology‐driven solutions aligned with ...
Segun E. Ibitoye   +8 more
wiley   +1 more source

Experimental Analysis of Ant System on Travelling Salesman Problem Dataset TSPLIB [PDF]

open access: yesEAI Endorsed Transactions on Pervasive Health and Technology, 2019
INTRODUCTION: Traveling Salesman Problem (TSP) is one of the vast research areas and has been considered as subproblems in many fields apart from computer science and also in the field of computer science.OBJECTIVES: This paper deals with the comparison ...
Kalaipriyan Thirugnanasambandam   +4 more
doaj   +1 more source

Optimization of distribution routes in resolving traveling salesman problems using the tabu search algorithm (case study: CV. Bintang anugerah sukses pekanbaru)

open access: yesDesimal, 2021
CV. Bintang Anugerah Sukses is a company engaged in the distribution of product PT. Belfoods Indonesia. Distribution of frozen goods distributes to 12 customer agencies using one vehicle.
Sri Basriati   +2 more
doaj   +1 more source

Quantifying Structural Complexity, Effort, and Performance: An Early Experiment Using Network Design Tasks

open access: yesSystems Engineering, EarlyView.
ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza   +3 more
wiley   +1 more source

STUDI TENTANG TRAVELLING SALESMAN DAN VEHICLE ROUTING PROBLEM DENGAN TIME WINDOWS

open access: yesJurnal Teknik Industri, 2003
The article shows the study of model development of travelling salesman problem. Three models are studied, i.e. travelling salesman problem with time windows, vehicle routing problem, and vehicle routing problem with time windows.
I Nyoman Sutapa   +2 more
doaj  

COMPARISON OF PARETO EFFICIENCY AND WEIGHTED OBJECTIVES METHOD TO SOLVE THE MULTI-CRITERIA VEHICLE ROUTING PROBLEM USING THE ARTIFICIAL IMMUNE SYSTEM [PDF]

open access: yesApplied Computer Science, 2016
The solutions to the multi-criteria vehicle routing problem, dependent on route length and travelling time of delivery van, are presented in the paper. This type of problem is known as a traveling salesman problem. The artificial immune system is used to
Bogna MRÓWCZYŃSKA
doaj  

A new heuristic algorithm based on minimum spanning tree for solving metric traveling salesman problem [PDF]

open access: yesInternational Journal of Industrial Engineering and Production Research
Due to the many applications of the travelling salesman problem, solving this problem has been considered by many researchers. One of the subsets of the travelling salesman problem is the metric travelling salesman problem in which a triangular ...
Malihe Masoumi, Javad Behnamian
doaj  

On random symmetric travelling salesman problems [PDF]

open access: yesThe 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings., 2003
Let the edges of the complete graph Kn be assigned independent uniform [0, 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor, respectively. We show that whp |ZTSP − Z2FAC| = o(1).
openaire   +1 more source

Home - About - Disclaimer - Privacy