Search results

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.

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.

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.

The model considers mid-sized problem instances. To analyze large size problems, heuristics and meta-heuristics may be used.

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.

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.

The effectiveness of product replenishment and responsiveness of customer service delivery impact largely on satisfaction and retention of customers in retail chain logistics distribution. The fast moving goods in the complex delivery network and limited vehicle resource often lead to long customer waiting time in stock replenishment. With lack of literature systematically reviewing factors affecting retail distribution in inter-store stock transfer services and improving the operations, the purpose of this paper is to analyse and enhance this service for the retail to reduce customer dissatisfaction by developing an integrated quality service improvement methodology and an optimisation tool to improve the product delivery services.

This paper reviews inter-store stock transfer operations and the process capability of an international retail chain, and proposes improvements by integrating Six Sigma, factor analysis, and optimisation modelling. User experience and expectations are evaluated through an empirical survey. A novel principle component factored inter-store stock transfer model is developed to improve replenishment operations. A total of 11 factors affecting inter-store stock transfer delivery time are analysed. An extended model with principal component factors incorporated is developed for the simulation.

The C_pk value of 0.51 shows significant difference between the experienced and expected waiting time. With the inter-store stock transfer optimisation model developed, the model assists traffic personnel on the vehicle route planning with multiple pick-up and drop-off locations. The system also ensures the best routing with a minimal travelling time planned, facilitating a reduction of the inter-store stock transfer time, thus improving the customer waiting time. Four significant factors affecting the delivery time are also identified from exploratory and confirmatory factor analysis. The results are analysed with an extended principal component factored inter-store stock transfer model.

The developed inter-store stock transfer models minimise stock transfer time, increase customer satisfaction, and reduce loss of sales. An integrated service quality improvement methodology has been developed and applied in reviewing significant factors affecting inter-store stock transfer operations.

This paper presents an analysis on inter-store stock transfer operations of an international retail and proposes enhancements on the operations by integrating Six Sigma, factor analysis, and optimisation modelling. A novel principal component factored inter-store stock transfer model is developed to improve the stock replenishment operations.

The purpose of this paper is to present the design and evaluation of an integrated system that supports planners and dispatchers to deliver enhanced courier operations. In addition to regular deliveries and pickups, these operations include: first, mass deliveries to be served over a horizon of multiple days; and second, real-time dynamic requests (DRs) to be served within the same service period.

To address the aforementioned challenges, the authors developed an architecture that enhances a typical fleet management system by integrating purpose designed methods. Specifically, the authors plan mass deliveries taking into account typical routes of everyday operations. For planning DRs in real time, the authors propose an efficient insertion heuristic.

The results from testing the proposed optimization algorithms for planning mass deliveries and real-time DRs are encouraging, since the proposed algorithms outperform current practices. Testing in a practical courier environment, indicated that the enhanced planning system may improve significantly operational performance.

The proposed optimization algorithm for the dynamic aspect of this problem comprises a heuristic approach that reaches suboptimal solutions of high quality. The development of fast optimal algorithms for solving these very interesting and practical problems is a promising area for further research.

The proposed integrated system addresses significant problems of hybrid courier operations in an integrated, balanced manner. The tests showed that the allocation of flexible orders within a three-day time horizon improved the cost per flexible order by 7.4 percent, while computerized routing improved the cost of initial (static) routing by 14 percent. Furthermore, the proposed method for managing DRs reduced the excess cost per served request by over 40 percent. Overall, the proposed integrated system improved the total routing costs by 16.5 percent on average compared to current practices.

Both the planning problems and the related solution heuristics address original aspects of practical courier operations. Furthermore, the system integration and the proposed systematic planning contribute to the originality of the work.

Preface The functions of business divide into several areas and the general focus of this book is on one of the most important although least understood of these—DISTRIBUTION. The particular focus is on reviewing current practice in distribution costing and on attempting to push the frontiers back a little by suggesting some new approaches to overcome previously defined shortcomings.

With the increasing awareness of global warming and the important role of last mile distribution in logistics activities, the purpose of this paper is to build an environmental and effective last mile distribution model considering fuel consumption and greenhouse gas emission, vehicle capacity and two practical delivery service options: home delivery (HD) and pickup site service (PS). This paper calls the problem as the capacitated pollution-routing problem with pickup and delivery (CPRPPD). The goal is to find an optimal route to minimize operational and environmental costs, as well as a set of optimal speeds over each arc, while respecting capacity constraints of vehicles and pickup sites.

To solve this problem, this research proposes a two-phase heuristic algorithm by combining a hybrid ant colony optimization (HACO) in the first stage and a multiple population genetic algorithm in the second stage. First, the HACO is presented to find the minimal route solution and reduce distribution cost based on optimizing the speed over each arc.

To verify the proposed CPRPPD model and algorithm, a real-world instance is conducted. Comparing with the scenario including HD service only, the scenario including both HD and PS option is more economical, which indicates that the CPRPPD model is more efficient. Besides, the results of speed optimization are significantly better than before.

The developed CPRPPD model not only minimizes delivery time and reduces the total emission cost, but also helps logistics enterprises to establish a more complete distribution system and increases customer satisfaction. The model and algorithm of this paper provide optimal support for the actual distribution activities of logistics enterprises in low-carbon environment, and also provide reference for the government to formulate energy-saving and emission reduction policies.

This paper provides a great space for the improvement of carbon emissions in the last mile distribution. The results show that the distribution arrangement including HD and PS services in the last mile adopting speed optimization can significantly reduce the carbon emission. Additionally, an integrated real-world instance is applied in this paper to illustrate the validity of the model and the effectiveness of this method.

The e-commerce boom presents new challenges for last-mile delivery (LMD), which may be mitigated by new delivery technologies. This paper evaluates the impact of mobile parcel lockers (MPL) on costs and CO₂ equivalent (CO₂e) emissions in existing LMD networks, which include home delivery and shipments to stationary parcel lockers.

To describe customers’ preferences, we design a multinomial logit model based on recipients’ travel distance to pick-up locations and availability at home. Based on route cost estimation, we define the operating costs for MPLs. We devise a mathematical model with binary decision variables to optimize the location of MPLs.

Our study demonstrates that integrating MPLs leads to additional cost savings of 8.7% and extra CO₂e emissions savings of up to 5.4%. Our analysis of several regional clusters suggests that MPLs yield benefits in highly populous cities but may result in additional emissions in more rural areas where recipients drive longer distances to pick-ups.

This paper designs a suitable operating model for MPLs and demonstrates environmental and economic savings. Moreover, it adds recipients’ availability at home to receive parcels improving the accuracy of stochastic demand. In addition, MPLs are evaluated in the context of several regional clusters ranging from large cities to rural areas. Thus, we provide managerial guidance to logistics service providers how and where to deploy MPLs.

This paper aims to study the vehicle routing problem with dynamic customers considering dual service (including home delivery [HD] and customer pickup [CP]) in the last mile delivery in which three decisions have to be made: determine routes that lie along the HD points and CP facilities; optimize routes in real time, which mode is better between simultaneous dual service (SDS, HD points and CP facilities are served simultaneously by the same vehicle); and respective dual service (RDS, HD points and CP facilities are served by different vehicles)?

This paper establishes a mixed integer linear programing model for the dynamic vehicle routing problem considering simultaneous dual services (DVRP-SDS). To increase the practical usefulness and solve large instances, the authors designed a two-phase matheuristic including construction-improvement heuristics to solve the deterministic model and dynamic programing to adjust routes to dynamic customers.

The computational experiments show that the CP facilities offer greater flexibility for adjusting routes to dynamic customers and that the SDS delivery system outperforms the RDS delivery system in terms of cost and number of vehicles used.

The results provide managerial insights for express enterprises from the perspective of operation research to make decisions.

This paper is among the first papers to study the DVRP-SDS. Moreover, this paper guides the managers to select better delivery mode in the last mile delivery.

The purpose of this paper is to formulate and solve a new emergency evacuation planning problem. This problem addresses the needs of both able and disabled persons who are evacuated from multiple pick-up locations and transported using a heterogeneous fleet of vehicles.

The problem is formulated using a mixed integer linear programming model and solved using a heuristic algorithm. The authors analyze the selected heuristic with respect to key parameters and use it to address theoretical and practical case studies.

Evacuating people with disabilities has a significant impact on total evacuation time, due to increased loading/unloading times. Additionally, increasing the number of large capacity vehicles adapted to transport individuals with disabilities benefits total evacuation time.

The mathematical model is of high complexity and it is not possible to obtain exact solutions in reasonable computational times. The efficiency of the heuristic has not been analyzed with respect to optimality.

Solving the problem by a heuristic provides a fast solution, a requirement in emergency evacuation cases, especially when the state of the theater of the emergency changes dynamically. The parametric analysis of the heuristic provides valuable insights in improving an emergency evacuation system.

Efficient population evacuation studied in this work may save lives. This is especially critical for disabled evacuees, the evacuation of whom requires longer operational times.

The authors consider a population that comprises able and disabled individuals, the latter with varying degrees of disability. The authors also consider a heterogeneous fleet of vehicles, which perform multiple trips during the evacuation process.