Search results
1 – 10 of over 4000Anand Jaiswal, Cherian Samuel and Chirag Chandan Mishra
The purpose of this paper is to provide a traffic route selection strategy based on minimum carbon dioxide (CO2) emission by vehicles over different route choices.
Abstract
Purpose
The purpose of this paper is to provide a traffic route selection strategy based on minimum carbon dioxide (CO2) emission by vehicles over different route choices.
Design/methodology/approach
The study used queuing theory for Markovian M/M/1 model over the road junctions to assess total time spent over each of the junctions for a route with junctions in tandem. With parameters of distance, mean service rate at the junction, the number of junctions and fuel consumption rate, which is a function of variable average speed, the CO2 emission is estimated over each of the junction in tandem and collectively over each of the routes.
Findings
The outcome of the study is a mathematical formulation, using queuing theory to estimate CO2 emissions over different route choices. Research finding estimated total time spent and subsequent CO2 emission for mean arrival rates of vehicles at junctions in tandem. The model is validated with a pilot study, and the result shows the best vehicular route choice with minimum CO2 emissions.
Research limitations/implications
Proposed study is limited to M/M/1 model at each of the junction, with no defection of vehicles. The study is also limited to a constant mean arrival rate at each of the junction.
Practical implications
The work can be used to define strategies to route vehicles on different route choices to reduce minimum vehicular CO2 emissions.
Originality/value
Proposed work gives a solution for minimising carbon emission over routes with unsignalised junctions in the tandem network.
Details
Keywords
Grzegorz Bocewicz, Mukund Nilakantan Janardhanan, Damian Krenczyk and Zbigniew Banaszak
The purpose of this paper is to focus on the reference model of a grid-like supply network that enables formulation of delivery routing and scheduling problems in the context of…
Abstract
Purpose
The purpose of this paper is to focus on the reference model of a grid-like supply network that enables formulation of delivery routing and scheduling problems in the context of the periodic vehicle routing problem.
Design/methodology/approach
The conditions for seamless (collision-free) synchronization of periodically executed local transport processes presented in this paper guarantee cyclic execution of supply processes, thereby preventing traffic flow congestion.
Findings
Systems that satisfy this characteristic, cyclic deliveries executed along supply chains are given and what is sought is the number of vehicles needed to operate the local transport processes in order to ensure delivery from and to specific loading/unloading points on given dates. Determination of sufficient conditions guaranteeing the existence of feasible solutions that satisfy these constraints makes it possible to solve the considered class of problems online.
Practical implications
The computer experiments reported in this paper show the possibilities of practical application of the proposed approach in the construction of decision support systems for food supply chain management.
Originality/value
The aim of the present work is to develop a methodology for the synthesis of regularly structured supply networks that would ensure fixed cyclic execution of local transport processes. The proposed methodology, which implements sufficient conditions for the synchronization of local cyclic processes, allows one to develop a method for rapid prototyping of supply processes that satisfies the time windows constraints given.
Details
Keywords
Sanjay Jharkharia and Chiranjit Das
The purpose of this study is to model a vehicle routing problem with integrated picking and delivery under carbon cap and trade policy. This study also provides sensitivity…
Abstract
Purpose
The purpose of this study is to model a vehicle routing problem with integrated picking and delivery under carbon cap and trade policy. This study also provides sensitivity analyses of carbon cap and price to the total cost.
Design/methodology/approach
A mixed integer linear programming (MILP) model is formulated to model the vehicle routing with integrated order picking and delivery constraints. The model is then solved by using the CPLEX solver. Carbon footprint is estimated by a fuel consumption function that is dependent on two factors, distance and vehicle speed. The model is analyzed by considering 10 suppliers and 20 customers. The distance and vehicle speed data are generated using simulation with random numbers.
Findings
Significant amount of carbon footprint can be reduced through the adoption of eco-efficient vehicle routing with a marginal increase in total transportation cost. Sensitivity analysis indicates that compared to carbon cap, carbon price has more influence on the total cost.
Research limitations/implications
The model considers mid-sized problem instances. To analyze large size problems, heuristics and meta-heuristics may be used.
Practical implications
This study provides an analysis of carbon cap and price model that would assist practitioners and policymakers in formulating their policy in the context of carbon emissions.
Originality/value
This study provides two significant contributions to low carbon supply chain management. First, it provides a vehicle routing model under carbon cap and trade policy. Second, it provides a sensitivity analysis of carbon cap and price in the model.
Details
Keywords
- Low carbon supply chain management (LCSCM)
- Vehicle routing with integrated pick-up and delivery
- Carbon cap and trade
- Carbon footprint
- Production and operations management
- Vehicle routing with integrated pick-up and delivery
- Carbon cap and trade
- GHG emissions
- Low carbon supply chain management (LCSCM)
Somia Boubedra, Cherif Tolba, Pietro Manzoni, Djamila Beddiar and Youcef Zennir
With the demographic increase, especially in big cities, heavy traffic, traffic congestion, road accidents and augmented pollution levels hamper transportation networks. Finding…
Abstract
Purpose
With the demographic increase, especially in big cities, heavy traffic, traffic congestion, road accidents and augmented pollution levels hamper transportation networks. Finding the optimal routes in urban scenarios is very challenging since it should consider reducing traffic jams, optimizing travel time, decreasing fuel consumption and reducing pollution levels accordingly. In this regard, the authors propose an enhanced approach based on the Ant Colony algorithm that allows vehicle drivers to search for optimal routes in urban areas from different perspectives, such as shortness and rapidness.
Design/methodology/approach
An improved ant colony algorithm (ACO) is used to calculate the optimal routes in an urban road network by adopting an elitism strategy, a random search approach and a flexible pheromone deposit-evaporate mechanism. In addition, the authors make a trade-off between route length, travel time and congestion level.
Findings
Experimental tests show that the routes found using the proposed algorithm improved the quality of the results by 30% in comparison with the ACO algorithm. In addition, the authors maintain a level of accuracy between 0.9 and 0.95. Therefore, the overall cost of the found solutions decreased from 67 to 40. In addition, the experimental results demonstrate that the authors’ improved algorithm outperforms not only the original ACO algorithm but also popular meta-heuristic algorithms such as the genetic algorithm (GA) and particle swarm optimization (PSO) in terms of reducing travel costs and improving overall fitness value.
Originality/value
The proposed improvements to the ACO to search for optimal paths for urban roads include incorporating multiple factors, such as travel length, time and congestion level, into the route selection process. Furthermore, random search, elitism strategy and flexible pheromone updating rules are proposed to consider the dynamic changes in road network conditions and make the proposed approach more relevant and effective. These enhancements contribute to the originality of the authors’ work, and they have the potential to advance the field of traffic routing.
Details
Keywords
Leila Hashemi, Armin Mahmoodi, Milad Jasemi, Richard C. Millar and Jeremy Laliberté
In the present research, location and routing problems, as well as the supply chain, which includes manufacturers, distributor candidate sites and retailers, are explored. The…
Abstract
Purpose
In the present research, location and routing problems, as well as the supply chain, which includes manufacturers, distributor candidate sites and retailers, are explored. The goal of addressing the issue is to reduce delivery times and system costs for retailers so that routing and distributor location may be determined.
Design/methodology/approach
By adding certain unique criteria and limits, the issue becomes more realistic. Customers expect simultaneous deliveries and pickups, and retail service start times have soft and hard time windows. Transportation expenses, noncompliance with the soft time window, distributor construction, vehicle purchase or leasing, and manufacturing costs are all part of the system costs. The problem's conceptual model is developed and modeled first, and then General Algebraic Modeling System software (GAMS) and Multiple Objective Particle Swarm Optimization (MOPSO) and non-dominated sorting genetic algorithm II (NSGAII) algorithms are used to solve it in small dimensions.
Findings
According to the mathematical model's solution, the average error of the two suggested methods, in contrast to the exact answer, is less than 0.7%. In addition, the performance of algorithms in terms of deviation from the GAMS exact solution is pretty satisfactory, with a divergence of 0.4% for the biggest problem (N = 100). As a result, NSGAII is shown to be superior to MOSPSO.
Research limitations/implications
Since this paper deals with two bi-objective models, the priorities of decision-makers in selecting the best solution were not taken into account, and each of the objective functions was given an equal weight based on the weighting procedures. The model has not been compared or studied in both robust and deterministic modes. This is because, with the exception of the variable that indicates traffic mode uncertainty, all variables are deterministic, and the uncertainty character of demand in each level of the supply chain is ignored.
Practical implications
The suggested model's conclusions are useful for any group of decision-makers concerned with optimizing production patterns at any level. The employment of a diverse fleet of delivery vehicles, as well as the use of stochastic optimization techniques to define the time windows, demonstrates how successful distribution networks are in lowering operational costs.
Originality/value
According to a multi-objective model in a three-echelon supply chain, this research fills in the gaps in the link between routing and location choices in a realistic manner, taking into account the actual restrictions of a distribution network. The model may reduce the uncertainty in vehicle performance while choosing a refueling strategy or dealing with diverse traffic scenarios, bringing it closer to certainty. In addition, two modified MOPSO and NSGA-II algorithms are presented for solving the model, with the results compared to the exact GAMS approach for medium- and small-sized problems.
Details
Keywords
Oussama Senouci, Zibouda Aliouat and Saad Harous
This paper is a review of a number routing protocols in the internet of vehicles (IoV). IoV emphasizes information interaction among humans, vehicles and a roadside unit (RSU)…
Abstract
Purpose
This paper is a review of a number routing protocols in the internet of vehicles (IoV). IoV emphasizes information interaction among humans, vehicles and a roadside unit (RSU), within which routing is one of the most important steps in IoV network.
Design/methodology/approach
In this paper, the authors have summarized different research data on routing protocols in the IoV. Several routing protocols for IoV have been proposed in the literature. Their classification is made according to some criteria such as topology-based, position-based, transmission strategy and network structure. This paper focuses on the transmission strategy criteria. There exist three types of protocols that are based on this strategy: unicast protocol, broadcast protocols and multicast protocols. This later type is classified into two subclasses: geocast and cluster-based protocols. The taxonomy of the transmission strategy is presented in this study. We discuss the advantages and disadvantages of each type with a general comparison between the five types.
Findings
The authors can deduce that many challenges are encountered when designing routing protocols for IoV.
Originality/value
A simple and well-explained presentation of the functioning of the IoV is provided with a comparison among each categories of protocols is well presented along with the advantages and disadvantages of each type. The authors examined the main problems encountered during the design of IoV routing protocol, such as the quick change of topology, the frequent disconnection, the big volume of data to be processed and stored in the IoV, and the problem of network fragmentation. This work explores, compares existing routing protocols in IoV and provides a critical analysis. For that, the authors extract the challenges and propose future perspectives for each categories of protocols.
Details
Keywords
Qinyang Bai, Xaioqin Yin, Ming K. Lim and Chenchen Dong
This paper studies low-carbon vehicle routing problem (VRP) for cold chain logistics with the consideration of the complexity of the road network and the time-varying traffic…
Abstract
Purpose
This paper studies low-carbon vehicle routing problem (VRP) for cold chain logistics with the consideration of the complexity of the road network and the time-varying traffic conditions, and then a low-carbon cold chain logistics routing optimization model was proposed. The purpose of this paper is to minimize the carbon emission and distribution cost, which includes vehicle operation cost, product freshness cost, quality loss cost, penalty cost and transportation cost.
Design/methodology/approach
This study proposed a mathematical optimization model, considering the distribution cost and carbon emission. The improved Nondominated Sorting Genetic Algorithm II algorithm was used to solve the model to obtain the Pareto frontal solution set.
Findings
The result of this study showed that this model can more accurately assess distribution costs and carbon emissions than those do not take real-time traffic conditions in the actual road network into account and provided guidance for cold chain logistics companies to choose a distribution strategy and for the government to develop a carbon tax.
Research limitations/implications
There are some limitations in the proposed model. This study assumes that there are only one distribution and a single type of vehicle.
Originality/value
Existing research on low-carbon VRP for cold chain logistics ignores the complexity of the road network and the time-varying traffic conditions, resulting in nonmeaningful planned distribution routes and furthermore low carbon cannot be discussed. This study takes the complexity of the road network and the time-varying traffic conditions into account, describing the distribution costs and carbon emissions accurately and providing the necessary prerequisites for achieving low carbon.
Details
Keywords
Eiichi Taniguchi, Russell G Thompson, Tadashi Yamada and Ron Van Duin