Статті в журналах: "Routing with profits"

1

Li, Jian, and Wenhua Lu. "Full truckload vehicle routing problem with profits." Journal of Traffic and Transportation Engineering (English Edition) 1, no. 2 (April 2014): 146–52. http://dx.doi.org/10.1016/s2095-7564(15)30099-4.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Li, Jianping, Kang Li, Lusheng Wang, and Hao Zhao. "Maximizing Profits of Routing in WDM Networks." Journal of Combinatorial Optimization 10, no. 2 (September 2005): 99–111. http://dx.doi.org/10.1007/s10878-005-2263-0.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Archetti, C., N. Bianchessi, and M. G. Speranza. "Optimal solutions for routing problems with profits." Discrete Applied Mathematics 161, no. 4-5 (March 2013): 547–57. http://dx.doi.org/10.1016/j.dam.2011.12.021.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

4

Archetti, Claudia, Luca Bertazzi, Demetrio Laganà, and Francesca Vocaturo. "The Undirected Capacitated General Routing Problem with Profits." European Journal of Operational Research 257, no. 3 (March 2017): 822–33. http://dx.doi.org/10.1016/j.ejor.2016.08.001.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

5

Archetti, Claudia, Dominique Feillet, Alain Hertz, and M. Grazia Speranza. "The undirected capacitated arc routing problem with profits." Computers & Operations Research 37, no. 11 (November 2010): 1860–69. http://dx.doi.org/10.1016/j.cor.2009.05.005.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Stavropoulou, F., P. P. Repoussis, and C. D. Tarantilis. "The Vehicle Routing Problem with Profits and consistency constraints." European Journal of Operational Research 274, no. 1 (April 2019): 340–56. http://dx.doi.org/10.1016/j.ejor.2018.09.046.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Lee, Dongoo, and Jaemyung Ahn. "Vehicle routing problem with vector profits with max-min criterion." Engineering Optimization 51, no. 2 (April 24, 2018): 352–67. http://dx.doi.org/10.1080/0305215x.2018.1458845.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Zachariadis, E. E., and C. T. Kiranoudis. "Local search for the undirected capacitated arc routing problem with profits." European Journal of Operational Research 210, no. 2 (April 2011): 358–67. http://dx.doi.org/10.1016/j.ejor.2010.09.039.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Archetti, Claudia, Nicola Bianchessi, M. Grazia Speranza, and Alain Hertz. "Incomplete service and split deliveries in a routing problem with profits." Networks 63, no. 2 (October 3, 2013): 135–45. http://dx.doi.org/10.1002/net.21529.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Poltavskaya, Yuliya. "ROUTING CARGO TRAFFIC IN MULTIMODAL TRANSPORT NETWORKS." Modern Technologies and Scientific and Technological Progress 2022, no. 1 (May 16, 2022): 195–96. http://dx.doi.org/10.36629/2686-9896-2022-1-195-196.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Multimodal transportation is widely used for trade between different regions and countries. The cost of international logistics is approximately 30-50% of all production costs of enterprises. Reducing transport costs allows you to increase profits and maintain the competitiveness of transport companies in the global market. Thus, optimization of routes in a multimodal transport network is an actual direction for research. An analytical review of the problem of planning routes for multimodal freight transportation is presented from the point of view of formulating a model

11

Vidal, Thibaut, Nelson Maculan, Luiz Satoru Ochi, and Puca Huachi Vaz Penna. "Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits." Transportation Science 50, no. 2 (May 2016): 720–34. http://dx.doi.org/10.1287/trsc.2015.0584.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Lo, Shih-Che, and Ying-Lin Chuang. "Vehicle Routing Optimization with Cross-Docking Based on an Artificial Immune System in Logistics Management." Mathematics 11, no. 4 (February 5, 2023): 811. http://dx.doi.org/10.3390/math11040811.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Background: Manufacturing companies optimize logistics network routing to reduce transportation costs and operational costs in order to make profits in an extremely competitive environment. Therefore, the efficiency of logistics management in the supply chain and the quick response to customers’ demands are treated as an additional source of profit. One of the warehouse operations for intelligent logistics network design, called cross-docking (CD) operations, is used to reduce inventory levels and improve responsiveness to meet customers’ requirements. Accordingly, the optimization of a vehicle dispatch schedule is imperative in order to produce a routing plan with the minimum transport cost while meeting demand allocation. Methods: This paper developed a two-phase algorithm, called sAIS, to solve the vehicle routing problem (VRP) with the CD facilities and systems in the logistics operations. The sAIS algorithm is based on a clustering-first and routing-later approach. The sweep method is used to cluster trucks as the initial solution for the second phase: optimizing routing by the Artificial Immune System. Results: In order to examine the performance of the proposed sAIS approach, we compared the proposed model with the Genetic Algorithm (GA) on the VRP with pickup and delivery benchmark problems, showing average improvements of 7.26%. Conclusions: In this study, we proposed a novel sAIS algorithm for solving VRP with CD problems by simulating human body immune reactions. The experimental results showed that the proposed sAIS algorithm is robustly competitive with the GA on the criterion of average solution quality as measured by the two-sample t-test.

13

Cura, Tunchan. "An artificial bee colony approach for the undirected capacitated arc routing problem with profits." International Journal of Operational Research 17, no. 4 (2013): 483. http://dx.doi.org/10.1504/ijor.2013.054973.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Kim, Gitae. "Dynamic Vehicle Routing Problem with Fuzzy Customer Response." Sustainability 15, no. 5 (March 1, 2023): 4376. http://dx.doi.org/10.3390/su15054376.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper proposes a dynamic vehicle routing problem (DVRP) model with fuzzy customer responses and suggests optimal routing strategies. Most DVRP studies have focused on how to create a new route upon the occurrence of dynamic situations such as unexpected demands. However, the customer responses have received little attention. When a pop-up demand is added to one of the planned routes, the service for some optimally planned demands may be delayed. Customers may file complaints or cancel their orders as a result of the delays. As a result, the customer response has a significant impact on current profits as well as future demands. In this research, we consider the customer response in DVRP and address it with a fuzzy number. Changing distances or defining time windows can resolve the problem of customer response. The customer responses are represented by a fuzzy rule. The new routing strategy provides the viability to reduce customer complaints and avoid losing potential customers.

15

Zhang, Mengying, John Wang, and Hongwei Liu. "The Probabilistic Profitable Tour Problem." International Journal of Enterprise Information Systems 13, no. 3 (July 2017): 51–64. http://dx.doi.org/10.4018/ijeis.2017070104.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

A new routing problem is introduced and named as the probabilistic profitable tour problem in this paper. The problem is defined on a complete graph where profits are associated with the vertices and travel costs are associated with the edges. Each vertex (customer) has a probability of requiring a visit on a given day. The tour starts and ends at a fixed vertex, and each vertex can never be visited more than one time. Once a vertex is visited, an associated profit is collected and the corresponding travel cost occurs. The objective is to find a subset of vertices and an a priori tour through those vertices that maximizes the difference between the expected profits and the expected travel costs. The problem is confronted by some big e-tailing companies who need to determine, among the set of all potential customers, the customers to be served by themselves and outsource the unselected customers. The problem under study is shown to be NP-hard in this paper. The authors provide a non-linear mathematical formulation for it. Consequently, a genetic algorithm is developed to solve this problem. The computational experiments carried out on small- and moderate-size instances show a good performance of the proposed algorithm.

16

He, Pengfei, and Jing Li. "Vehicle routing problem with partly simultaneous pickup and delivery for the cluster of small and medium enterprises." Archives of Transport 45, no. 1 (March 30, 2018): 35–42. http://dx.doi.org/10.5604/01.3001.0012.0940.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The transportation service for the cluster of small and medium enterprises (SMEs) is different with traditional vehicle routing problems. In the cluster of SMEs, parts of enterprises are pickup and delivery spots simultaneously. But some enterprises are partly pickup and delivery simultaneously. Traditional mathematics models and algorithms are not suitable to solve the vehicle routing problem partly simultaneous pickup and delivery (VRPPSD). In this paper, a mathematics operational model is proposed to analyze the transportation service of the cluster companies. A hybrid algorithm which is composed by tabu search, genetic algorithm and local search is used to optimize the operational model. The crossover and mutation contained by genetic algorithm is used to generate neighborhood solutions for tabu search. The data of a cluster of SMEs, investigating from Changzhou city, China, are employed to show the validity of our model. The results indicate that our model and hybrid algorithm is effective to solve VRPPSD. In this paper, the satisfied solutions of VRPPSD are found by hybrid algorithm. At the same time, the results also show that carriers with optimal routs can service customers with more profits (increasing 5.6%). The potential saving of transport cost will increase profits of carriers in SMEs.

17

Yang, Ji Hao, Xing Wei Wang, and Min Huang. "Elitist Distance Based Pareto Genetic Unicast Routing Scheme with Always Best Connected Support." Applied Mechanics and Materials 427-429 (September 2013): 2245–53. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2245.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this paper, an ABC (Always Best Connected) supported QoS (Quality of Service) unicast routing scheme is proposed. In the proposed scheme, in order to overcome difficulties on accurately measuring network link parameter values and exactly expressing user QoS requirements, the knowledge of the fuzzy mathematics and probability theory is introduced, and the range is used to describe these parameters; both of the users utility and the network providers utility are computed, and gaming analysis is taken to deal with profits of both the user and the network provider; EDPGA (Elitist Distance-based Pareto Genetic Algorithm) is used to find the specific QoS unicast path with Pareto optimum under Nash Equilibrium among all parties utilities achieved or approached. While comparing with unicast routing scheme based on Dijkstra and the game theory based fuzzy unicast QoS routing scheme, simulation results show that this proposed scheme is both feasible and effective.

18

N. F., Mohamed, Mohamed N. A., Mohamed N. H., and Subani N. "Comparison of two hybrid algorithms on incorporated aircraft routing and crew pairing problems." Indonesian Journal of Electrical Engineering and Computer Science 18, no. 3 (June 1, 2020): 1665. http://dx.doi.org/10.11591/ijeecs.v18.i3.pp1665-1672.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In airline operations planning, a sequential method is traditionally used in airline system. In airline systems, minimizing the costs is important as they want to get the highest profits. The aircraft routing problem is solved first, and then pursued by crew pairing problem. The solutions are suboptimal in some cases, so we incorporate aircraft routing and crew pairing problems into one mathematical model to get an exact solution. Before we solve the integrated aircraft routing and crew pairing problem, we need to get the aircraft routes (AR) and crew pairs (CP). In this study, we suggested using genetic algorithm (GA) to develop a set of AR and CP. By using the generated AR and CP, we tackle the integrated aircraft and crew pairing problems using two suggested techniques, Integer Linear Programming (ILP) and Particle Swarm Optimization (PSO). Computational results show that GA's executed of AR and CP and then solved by ILP obtained the greatest results among all the methods suggested.

19

Orlis, Christos, Demetrio Laganá, Wout Dullaert, and Daniele Vigo. "Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements." Omega 93 (June 2020): 102034. http://dx.doi.org/10.1016/j.omega.2019.02.003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Ahn, Jaemyung, Olivier de Weck, Yue Geng, and Diego Klabjan. "Column generation based heuristics for a generalized location routing problem with profits arising in space exploration." European Journal of Operational Research 223, no. 1 (November 2012): 47–59. http://dx.doi.org/10.1016/j.ejor.2012.06.018.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

21

MAJDOUB, MANEL, ALI EL KAMEL, and HABIB YOUSSEF. "DQR: An Efficient Deep Q-Based Routing Approach in Multi-Controller Software Defined WAN (SD-WAN)." Journal of Interconnection Networks 20, no. 04 (December 2020): 2150002. http://dx.doi.org/10.1142/s021926592150002x.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Software Defined Networking (SDN) is a promising paradigm in the field of network technology. This paradigm suggests the separation between the control plane and the data plane which brings flexibility, efficiency and programmability to network resources. SDN deployment in large scale networks raises many issues which can be overcame using a collaborative multi-controller approaches. Such approaches can resolve problems of routing optimization and network scalability. In large scale networks, such as SD-WAN, routing optimization consists of achieving a trade-off between per-flow QoS, the load balancing in each domain as well as the resource utilization in inter-domain links. Multi-Agent Reinforcement Learning paradigm(MARL) is one of the most popular solutions that can be used to optimize routing strategies in SD-WAN. This paper proposes an efficient approach based on MARL which is able to ensure a load balancing among each network as well as optimized resource utilization of inter-domain links. This approach profits from our previous work, denoted SPFLR, and tries to balance the load of the whole network using Deep Q-Networks (DQN) algorithms. Simulation results show that the proposed solution performs better than parallel solutions such as BGP-based routing and random routing.

22

Chentli, Hayet, Rachid Ouafi, and Wahiba Ramdane Cherif-Khettaf. "A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services." RAIRO - Operations Research 52, no. 4-5 (October 2018): 1295–328. http://dx.doi.org/10.1051/ro/2018024.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The Vehicle Routing Problem with Simultaneous Pickups and Deliveries (VRPSPD) is a variant of the Vehicle Routing Problem. In this variant, an unlimited fleet of capacitated vehicles is used to satisfy both pickup and delivery demands of each customer simultaneously. In many practical situations, such a fleet is costly. The present study extends the VRPSPD by assuming a fixed number of vehicles when the constraint of visiting all customers is relaxed. More specifically, profits are assigned to the customers with the goal of maximizing the difference between collected profits and routing costs. This variant is named Profitable Tour Problem with Simultaneous Pickup and Delivery services (PTPSPD). We present a mathematical model run with the CPLEX solver. We also present an extension of the Adaptive Large Neighborhood Search heuristic (ALNS) called selective ALNS (sALNS). sALNS uses a new operator selection that executes two phases alternately: the random and the score-dependent phases. An appropriate update of scores is employed. Furthermore, sALNS explores missed regions of the search space by evaluating solutions after the destruction step. Finally, we give tuned insertion and removal operators that handle the constraints of the PTPSPD, as well as a new update of temperature, that helps avoiding local optima, in the Simulated Annealing embedded in sALNS. sALNS is evaluated on 117 new instances with 50–199 customers. A comparison is made between the components of sALNS, the classical ALNS and a recent ALNS heuristic from the literature. sALNS is also evaluated on some VRPSPD instances from the literature. The computational results show that our heuristic provides good quality solutions in reasonable computing time.

23

Boro, Sunil, and Santosh Kumar Behera. "AN APPROACH FOR VEHICLE ROUTING PROBLEM USING GRASSHOPPER OPTIMIZATION ALGORITHM AND SIMULATED ANNEALING." International Journal of Advanced Research 9, no. 03 (March 31, 2021): 59–64. http://dx.doi.org/10.21474/ijar01/12554.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper is focused on the study of the basic problem of the vehicle for reducing the cost factor and increasing efficiency of the solution. Features and constraint uses some capabilities of the algorithm used to modify it dynamically between the nodes and depot. This is demonstrated with a feasible schedule for every node and minimizes the total cost as much as possible. The analysis is based on the address of the given model and solution procedure.The purpose of this research paper is to provide examples of models and applications which include the profits, extensions and partitioned features. The objective is to minimize the traveled distance that visits every subset of nodes one after another while maximizing or satisfying a minimum collected profit from each visited node. The concepts of VRP are discussed in Section I and the issues discussed in paper are in Section VI. Section VI also contains the modeling aspects and constraints that can be used in solving VRP in this paper. Simulated annealing and grasshopper optimization algorithm are combined for solving vehicle routing problem as discussed in Section VII. This study investigates both the variants of algorithm for the clustering nodes and different methods for the generation of routes to overcome optimal VRP solution. In conventional grasshopper algorithm, shortest path for certain node that starts from center depot is calculated by means of local search algorithms. Few methods such as ant colony optimization and genetic algorithm are considered for the route optimization. We can compare the performance of these methods to solve the VRP. Therefore, performance of the proposed method is able to produce better solutions than the other methods which reveal a large number of benchmark experimental results and is very promising.

24

Soenandi, Iwan Aang, Joice Joice, and Budi Marpaung. "Optimasi Capacitated Vehicle Routing Problem with Time Windows dengan Menggunakan Ant Colony Optimization." Jurnal Sistem dan Manajemen Industri 3, no. 1 (July 31, 2019): 59. http://dx.doi.org/10.30656/jsmi.v3i1.1469.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In recent years, minimization of logistics and transportation costs has become essential for manufacturing companies to increase profits. One thing is done to reduce logistics and transportation costs by optimizing the route of taking or transporting components from each supplier. Route optimization to minimize total transportation costs is a problem that often finds in Vehicle Routing Problems (VRP). Problem Capacitated Vehicle Routing with Time Windows (CVRPTW) is one variant of VRP that considers the vehicle capacity and the service period of each vehicle. CVRPTW is a Non-Polynomial Hard (NP-Hard) problem that requires an efficient and effective algorithm in solving problems that occur in this automotive company. This study uses the Ant Colony Optimization (ACO) algorithm by testing using several parameters to solve the CVRPTW problem. The test results using the ACO algorithm obtained a faster route compared to the method applied by the company.

25

Ogumeyo, S. A., and C. E. O. Omole. "APPLICATION OF TRANSPORTATION MODEL TO SOLVE TANKERS’ – ROUTING PROBLEM." FUDMA JOURNAL OF SCIENCES 8, no. 2 (April 30, 2024): 259–66. http://dx.doi.org/10.33003/fjs-2024-0802-2352.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The problem of selecting minimum cost routes for tankers in distributing petroleum products and satisfying customers’ requirement without scarcity in Nigeria remains a huge challenge to major marketers in the oil industries. The cost of transporting petroleum products from sources to destinations matters a lot to oil marketers because of the direct impact it has on their profits. The means of distributing petroleum products from refineries to depots or filling stations are tankers’ routing and pipelines. In this research, we extended some existing tankers’-routing models in literature which use a discrete integer programming approach to determine efficient and effective distribution of petroleum products. Consequently, we developed a new transportation linear programming algorithm to determine minimum cost routes in the delivery of petroleum product from their supply centers (refinery) to demand centers (filling stations). The significance of the application we adopted in this research lies in the modified distribution approach to tackle the complexity involved when transportation problems are formulated as linear programming problem having several variables and constraints. In this research, we formulate a new version of transportation model of tankers’ routing with the aim of reducing the cost of petroleum products delivery. The proposed transportation linear programming model was applied to a numerical example alongside other existing transportation algorithms. It is observed that, the new algorithm produced approximately the same total cost obtained by using other existing algorithms

26

Li, Manman, Jian Lu, and Wenxin Ma. "A Hybrid Multi-objective Genetic Algorithm for Bi-objective Time Window Assignment Vehicle Routing Problem." PROMET - Traffic&Transportation 31, no. 5 (October 18, 2019): 513–25. http://dx.doi.org/10.7307/ptt.v31i5.3057.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Providing a satisfying delivery service is an important way to maintain the customers’ loyalty and further expand profits for manufacturers and logistics providers. Considering customers’ preferences for time windows, a bi-objective time window assignment vehicle routing problem has been introduced to maximize the total customers’ satisfaction level for assigned time windows and minimize the expected delivery cost. The paper designs a hybrid multi-objective genetic algorithm for the problem that incorporates modified stochastic nearest neighbour and insertion-based local search. Computational results show the positive effect of the hybridization and satisfactory performance of the metaheuristics. Moreover, the impacts of three characteristics are analysed including customer distribution, the number of preferred time windows per customer and customers’ preference type for time windows. Finally, one of its extended problems, the bi-objective time window assignment vehicle routing problem with time-dependent travel times has been primarily studied.

27

Ryu, Jong-Hyun, and Seong Wook Hwang. "Optimizing Electric Truck Routing and Charging with Soft Time Windows Using Vehicle-to-Grid Technology." Journal of Advanced Transportation 2023 (December 5, 2023): 1–10. http://dx.doi.org/10.1155/2023/6674586.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Due to the rapid increase in the use of electric vehicles and instability in energy supply, the application of vehicle-to-grid (V2G) technology has gained attention in the freight transportation sector. V2G has the potential to increase the efficiency of power grid and make additional profits by utilizing surplus power from electric vehicle batteries. This paper proposes an optimization model for electric trucks (ETs) to provide operational decision-making support for the freight transportation sector. The objective of the model is to minimize the total net cost, which includes charging cost, discharging reward, and time penalties, while considering changes in ET charging cost and the system marginal price. Furthermore, we conduct sensitivity analysis in the vehicle routing problem with soft time windows using ETs in the V2G system.

28

Gavalas, Damianos, Charalampos Konstantopoulos, Konstantinos Mastakas, and Grammati Pantziou. "Efficient Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows." Asia-Pacific Journal of Operational Research 36, no. 01 (February 2019): 1950001. http://dx.doi.org/10.1142/s0217595919500015.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In the Team Orienteering Problem with Time Windows (TOPTW), a variant of the Vehicle Routing Problem with Profits, a set of locations is given, each associated with a profit, a visiting time and a time window. The aim is to maximize the overall profit collected by a number of routes, while the duration of each route must not exceed a given time budget. TOPTW is NP-hard and is typically used to model the Tourist Trip Design Problem. The latter deals with deriving near optimal multiple-day tours for tourists visiting a destination with several points of interest (POIs). The most efficient known heuristic approach to TOPTW which yields the best solution quality versus execution time, is based on Iterated Local Search (ILS). However, the ILS algorithm treats each node separately, hence it tends to overlook highly profitable areas of nodes situated far from the current solution, considering them too time-expensive to visit. We propose two cluster-based extensions to ILS addressing the aforementioned weakness by grouping nodes on separate clusters (based on geographical criteria), thereby making visits to such nodes more attractive. Our approaches improve ILS with respect to solutions quality and execution time as evidenced by experimental tests exercised on both existing and new TTDP-oriented benchmark instances.

29

Hong, June S., and Mihui Kim. "Game-Theory-Based Approach for Energy Routing in a Smart Grid Network." Journal of Computer Networks and Communications 2016 (2016): 1–8. http://dx.doi.org/10.1155/2016/4761720.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Small power plants and buildings with renewable power generation capability have recently been added to traditional central power plants. Through these facilities, prosumers appear to have a concurrent role in both energy production and consumption. Based on bidirectional power transfers by large numbers of prosumers, a smart microgrid has become an important factor in efficiently controlling the microgrids used in power markets and in conducting effective power trades among grids. In this paper, we present an approach utilizing the game theory for effective and efficient energy routing, which is a novel and challenging procedure for a smart microgrid network. First, we propose strategies for choosing the desired transaction price for both electricity surpluses and shortages to maximize profits through energy transactions. An optimization scheme is utilized to search for an energy route with minimum cost using the solving method used in a traditional transportation problem by treating the sale and purchase quantities as transportation supply and demand, respectively. To evaluate the effect of the proposed decision strategies, we simulated our mechanism, and the results proved that our mechanism yields results pursued by each strategy. Our proposed strategies will contribute to spreading a smart microgrid for enhancing the utilization of microgrids.

30

Dang, Yibo, Manjeet Singh, and Theodore T. Allen. "Network Mode Optimization for the DHL Supply Chain." INFORMS Journal on Applied Analytics 51, no. 3 (May 2021): 179–99. http://dx.doi.org/10.1287/inte.2020.1046.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

DHL Supply Chain North America moves more than 20 million packages each year. DHL transportation planners perform routing and cost-deduction tasks for many business projects. We refer to the associated planning problem as the Vehicle Routing Problem with Time Regulations and Common Carriers (VRPTRCC). Unlike ordinary vehicle routing problems, which use only a single type of transportation mode, our VRPTRCC applications include make–buy decisions because some of the package deliveries are ultimately subcontracted to organizations other than DHL. Time regulation means that the problem considers not only delivery-time windows, but also layover and driving-time restrictions. Our developed Network Mode Optimization Tool (NMOT) is an ant-colony optimization (ACO)-based program that aids DHL Supply Chain transportation analysts in identifying cost savings in the ground logistic network. By using the NMOT, DHL and its customers have saved millions of dollars annually. Also, the NMOT is helping DHL to win new customers against bidding competitors and reducing estimation times from multiple weeks to hours. The results show an actual increase in profits compared with the previous process by more than 15% through a combination of new projects enabled and reduced current operational costs. The NMOT is implemented and evaluated by using data from ongoing projects.

31

Srikanth, Nandoori, and Muktyala Sivaganga Prasad. "Energy Efficient Trust Node Based Routing Protocol (EETRP) to Maximize the Lifetime of Wireless Sensor Networks in Plateaus." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 06 (March 29, 2019): 113. http://dx.doi.org/10.3991/ijoe.v15i06.10340.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector. The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency. The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.

32

Hulianitskyi, Leonid, Vyacheslav Korolyov, and Oleksandr Khodzinskyi. "An Overview of Algorithms for Solving Vehicle Routing Problems in the Quantum-Classical Cloud." Cybernetics and Computer Technologies, no. 2 (July 28, 2023): 23–31. http://dx.doi.org/10.34229/2707-451x.23.2.3.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Introduction. The hope of solving the problem of the avalanche-like growth of requirements for computing power, essential for solving complex routing problems and other problems of combinatorial optimization, relies on the latest quantum computers, in the development of which governments and corporations invest multi-billion investments. The article examines modern routing algorithms and performs their analysis and verification, if the authors of the algorithm provided appropriate test programs. The purpose of the article is to review the current state of development in the field of development of routing algorithms for hybrid quantum-classical clouds, analyze them and propose a classification of algorithms. Results. Modern quantum computers (QCs) make it possible to find approximate solutions to some of mathematical problems faster than classical computers. The inaccuracy of the solutions obtained by the QC is a consequence of physical and technological limitations: calculation errors are caused by thermal noise, a small number of computational elements - qubits and connections between them, which requires the decomposition of the problem and the use of heuristic algorithms. The analysis of approaches to the solution of optimization problems on QC allows us to single out: quantum response and variational search of eigenvalues based on quantum logic gates as the general directions of development of the vast majority of algorithms for solving routing problems. The considered algorithms reduce the vehicle routing problem to a quadratic unconstrained binary optimization problem, which is isomorphic to the Hamilton-Ising model. In this form, the problem is suitable for embedding in QC, which finds an approximate solution that has the best statistical reliability or corresponds to the quantum state with the lowest energy. As a separate class, vehicle routing algorithms for classical computers that use quantum computing to accelerate problem solving can be distinguished. For example, neural networks that calculate weighting factors using QC or an ant algorithm that calculates a pheromone trail in a hybrid cloud. It should be mentioned the quantum-inspired algorithms, which are based on software tools for the simulation of QC and the corresponding libraries and allow creating an effective class of algorithms for solving problems of vehicle routing. Conclusions. Combining hardware quantum annealing with a number of software tools for calculating optimization problems for classical computers in a hybrid quantum-classical cloud service allows to obtain advantages in speed and accuracy of some types of complex optimization problems of a commercial scale, in particular, routing vehicles, which is already bringing substantial profits to a number of corporations. Keywords: vehicle routing problem, quantum computer, annealing, combinatorial optimization, traveling salesman problem, clustering, qubit.

33

Ahsan, Syed Muhammad, Hassan Abbas Khan, Sarmad Sohaib, and Anas M. Hashmi. "Optimized Power Dispatch for Smart Building and Electric Vehicles with V2V, V2B and V2G Operations." Energies 16, no. 13 (June 22, 2023): 4884. http://dx.doi.org/10.3390/en16134884.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The operation of smart buildings (with solar, storage and suitable power routing infrastructure) can be optimized with the addition of parking stations for electric vehicles (EVs) with vehicle-to-everything (V2X) operations including vehicle-to-vehicle (V2V), vehicle-to-building (V2B) and vehicle-to-grid (V2G) operations. In this paper, a multi-objective optimization framework is proposed for the smart charging and discharging of EVs along with the maximization of revenue and savings of smart building (prosumers with solar power, a battery storage system and a parking station) and non-primary/ordinary buildings (consumers of electricity without solar power, a battery storage system and parking station). A mixed-integer linear program is developed to maximize the profits of smart buildings that have bilateral contracts with non-primary buildings. The optimized charging and discharging (V2X) of EVs at affordable rates utilizing solar power and a battery storage system in the smart building helps to manage the EV load during on-peak hours and prevent utility congestion. The results indicate that in addition to the 4–9% daily electricity cost reductions for non-primary buildings, a smart building can achieve up to 60% of the daily profits. Further, EVs can save 50–69% in charging costs while performing V2X operations.

34

Wang, Xiao Fei, Ying Cai, and Zhuo Li. "Survey on Cooperation Incentive Mechanisms in MANETs." Applied Mechanics and Materials 513-517 (February 2014): 1811–18. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.1811.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

A lack of centralized administrator has made communications in mobile ad hoc networks relied on cooperation of mobile nodes. Apparently, their limited energy cannot provide a sustained supply for consumption on operations, such as relaying, forwarding, etc. This may cause the self-ish behaviors of non-cooperative nodes, resulting in degradation on the stability or reliability of routing. The self-ishness worsens because of node mobility. Most existing works were considering external profits and inner motivations. In this paper, we analyzed three kinds of incentive mechanisms based on virtual currency, reputation and game theory, respectively. We compared application scenarios and performance of these mechanisms, and discussed their limitations. Finally we proposed possible directions for the future research on the incentive mechanisms in mobile ad hoc networks.

35

Singh, Dr Bhopendra, P. Kavitha, R. Regin, Dr K. Praghash, S. Sujatha, and Dr S. Suman Rajest. "Optimized Node Clustering based on Received Signal Strength with Particle Ordered-filter Routing Used in VANET." Webology 17, no. 2 (December 21, 2020): 262–77. http://dx.doi.org/10.14704/web/v17i2/web17029.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

VANET is a critical and demanding mission. Numerous methods exist, but none profits in a distributed fashion from physical layer parameters. This paper describes a method that enables individual nodes to estimate node density, independent of beacon messages, and other infrastructure-based information, of their surrounding network. In this paper, a discrete simulator of events was proposed to estimate the average number of simultaneously transmitting nodes, a functional channel model for the VANETs system, and a method of estimating node density. Proposed based on some equations to allow individual nodes to estimate their surrounding node density in real-time Optimized Node Cluster Algorithm with Network Density in which the composition of a cluster is triggered adjacent, these traffic signals is the same and has been predicated mostly on the position a vehicle might well take after crossing. Additional Ordered Tracking with Particle -Filter Routing in which receives simultaneous signal intensity versus node transmission and node density transmission. Conduct multiple location-related analyzes to test the plausibility of the neighboring single-hop nodes on mobility data. The system is designed to operate in the most complex situations where nodes have little knowledge of network topology and the results, therefore, indicate that the system is fairly robust and accurate.

36

Maslyhan, Olena, Erika Todierishko, Sviatoslav Zhukov, and Mariya Kashka. "Routing for tourist and excursion bureaus based at parametric network models." Economic Annals-ХХI 191, no. 7-8(1) (August 10, 2021): 100–113. http://dx.doi.org/10.21003/ea.v191-08.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This study is devoted to applying parametric network models for the process of defining a guided tour route within route networks on the example of Denmark. This is caused by difficulty in determining variations when organizing guided tours. Under the actual digitization conditions, tourist and excursion bureaus are being restructured from static organizations administering various excursions into dynamic ones. They are actually getting adjusted to the customers’ needs and demands, taking into account the actual possibilities for covering a certain topic by the tour party within a route. The main problem encountered by tourist and excursion bureaus is the following. Although the nomenclature of presented guided tours is established by the economic entity independently, those are not always carried out according to a clearly defined itinerary and on the same conditions for all participants. When providing such services, customers’ demands and service peculiarities are not known in advance. The purpose of the present study is to provide a substantive basis for routing in tourist and excursion bureaus, based on parametric network models and taking into account the peculiarities of dynamically adaptable tables containing the best routes. To achieve the research goal, network planning methods were used, such as analytical, tabular, cloud computing in the AnyLogic Cloud environment. As a result of the study, a substantive basis of routing of the tourist route was presented for tourist and excursion bureaus, through their parametric network models. The study was implemented at the sample of the Denmark Tour -Your Guide Office, a company founded within cooperation with Russian, Ukrainian, and Denmark partners and providing travel services within the Denmark tourist market. The Office includes about 20 affiliates in Denmark, where route networks have already been adapted to designing tours in practice and parameterization of such networks is well underway, in particular by shifting the focus from the route distance rate to minimization of transfers between attraction sites. However, to provide a substantive basis for the routing in a tourist office, parameters of the routing networks should be determined not only based on the list of actions (activities) to be carried out, but also on their minimum and maximum possible duration. A lack of due attention to the servicing time for the tour groups will lead to breaking tour schedules. Thus, in 2020, as a result of the inefficient parameterization at Denmark Tour - Your Guide, about 5-6 tours around Aalborg and its vicinity were cancelled monthly. Denmark Tour- Your Guide incurs monthly profit losses at 15% in 4-6 tours around Aarhus and its surroundings, Jursland peninsula, rated at a fixed cost, as the result of payment of a fixed cost for the selected excursions. A similar situation, with breaking tour schedules and monthly losses incurred, is common with tourist and excursion bureaus in various countries around the world, including Ukraine. According to the results of the study, it is marked that the routing of tourist itineraries designed by tourist agencies, based on parametric network models turns their static time reserves and operational metrics into dynamic values depending on the duration of the tour activities. This not only ensures following schedules properly in all tours but also minimizes monthly profit loss, at an estimated EUR 2,250 for the Aalborg and its surroundings routes. Meanwhile, there may be situations where it is not possible to change the total tour cost. For example, in the company Denmark Tour - Your Guide, when working with intermediate parties, this price is fixed. To prevent incurring monthly losses within 15% of the profits for 4-6 tours of Aarhus and its surroundings, Jursland peninsula, Aalborg and Surroundings, it is necessary to make some quite specific adjustments in some activities at the sites. These should take into account the time reserve values on the longest route. A special tour activity complex is to be completed, with a maximum difference in early and late schedule times, standard and urgent pricing for the site operations). A procedure is compiled for minimizing losses in routes (over 8K euro annually), providing for completion of the activity complex within the schedule with a minimum additional charge to the operating metric (the route price), since it is not reimbursed by the tourists. It is important that the results presented should identify the path adjustments of each route simultaneously, taking into account the actual time reserve (available based on the tour group location and the previouisly completed schedule items on the tour). Prospects for practical implementation of the presented substantiation basis for the itinerary routing to be used in tourist and excursion bureaus, based on parametric network models, are in establishing facilities for creating dynamic graphic images of the whole tour procedure, in the form of a directed graph of the route network.

37

Herrera Ochoa, Oscar Javier, Nicolas Arrieta Camacho, Vianey Lizeth Jerez Amador, Geraldine Camacho Perez, and Ivan Dario Romero. "Transshipment and Routing Model for Multi-Product Planning and Distribution at a Refreshment Company in Bogota, Colombia." Journal of Applied Research and Technology 20, no. 4 (August 31, 2022): 408–17. http://dx.doi.org/10.22201/icat.24486736e.2022.20.4.1330.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this article, a model is established for the planning of the weekly distribution of refreshments in a company that produces 6 types of beverages in 3 Production Centers, with the potential use of 3 Distribution Centers and supplying 22 Consumer Centers located in Bogota. Due to the impact of transportation costs on the company profits, it is necessary to determine the optimal planning of the allocation of sources to destinations in the nodal network of the system and its subsequent routing with two types of vehicles. Therefore, a two-phase model is proposed. In the first, the initial optimal assignments are established by comparing two techniques; one based on the Open Transshipment Problem (OTP) and the other on the Capacitated Transshipment Problem (CTP), which determine the trips to be made from production centers to consumer centers using distribution centers as intermediaries. This comparison allowed to analyze its efficiency to choose the model with the lowest cost and number of trips. In the second phase, routing was performed on routes that do not use the full capacity of the vehicles. The routes were established through the Travelling Salesman Problem (TSP). As a result, a comprehensive model was obtained to carry out the planning of the product distribution, obtaining in Phase II the use of the OTM model, which presented 14% less distance; 2.6% less time and 0.28% less than the total cost compared to the CTP model. In Phase II 5 routes were obtained, of which Distribution Center 2 covers 59% of customers.

38

Faulin, Javier, Fernando Lera-López, and Angel A. Juan. "Optimizing Routes with Safety and Environmental Criteria in Transportation Management in Spain." International Journal of Information Systems and Supply Chain Management 4, no. 3 (July 2011): 38–59. http://dx.doi.org/10.4018/jisscm.2011070103.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The object of logistic management is to optimise the whole value chain of the distribution of goods and merchandise. One of the main aspects of such an analysis is the optimisation of vehicle routes to deliver final products to customers. There are many algorithms to optimise the related vehicle routing problem. The objective function of that problem usually involves distance, cost, number of vehicles, or profits. This study also takes safety and environmental costs into account. Thus, the authors develop variants to traditional heuristic algorithms, in which they include the traditional costs along with safety and environmental cost estimates for real scenarios in Spain. This methodology is called ASEC (Algorithms with Safety and Environmental Criteria). These considerations raise the value of the global objective function, but permit a more realistic cost estimate that includes not only the internal costs involved in the problem but also the related externalities. Finally, real cases are discussed, and solutions are offered using the new ASEC methodology.

39

Ding, Yi, Baoshen Guo, Lin Zheng, Mingming Lu, Desheng Zhang, Shuai Wang, Sang Hyuk Son, and Tian He. "A City-Wide Crowdsourcing Delivery System with Reinforcement Learning." Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies 5, no. 3 (September 9, 2021): 1–22. http://dx.doi.org/10.1145/3478117.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The revolution of online shopping in recent years demands corresponding evolution in delivery services in urban areas. To cater to this trend, delivery by the crowd has become an alternative to the traditional delivery services thanks to the advances in ubiquitous computing. Notably, some studies use public transportation for crowdsourcing delivery, given its low-cost delivery network with millions of passengers as potential couriers. However, multiple practical impact factors are not considered in existing public-transport-based crowdsourcing delivery studies due to a lack of data and limited ubiquitous computing infrastructures in the past. In this work, we design a crowdsourcing delivery system based on public transport, considering the practical factors of time constraints, multi-hop delivery, and profits. To incorporate the impact factors, we build a reinforcement learning model to learn the optimal order dispatching strategies from massive passenger data and package data. The order dispatching problem is formulated as a sequential decision making problem for the packages routing, i.e., select the next station for the package. A delivery time estimation module is designed to accelerate the training process and provide statistical delivery time guarantee. Three months of real-world public transportation data and one month of package delivery data from an on-demand delivery platform in Shenzhen are used in the evaluation. Compared with existing crowdsourcing delivery algorithms and widely used baselines, we achieve a 40% increase in profit rates and a 29% increase in delivery rates. Comparison with other reinforcement learning algorithms shows that we can improve the profit rate and the delivery rate by 9% and 8% by using time estimation in action filtering. We share the data used in the project to the community for other researchers to validate our results and conduct further research.1 [1].

40

Ma, Lingji, and Meiyan Li. "Research on a Joint Distribution Vehicle Routing Problem Considering Simultaneous Pick-Up and Delivery under the Background of Carbon Trading." Sustainability 16, no. 4 (February 19, 2024): 1698. http://dx.doi.org/10.3390/su16041698.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In order to explore the positive impact of the joint distribution model on the reduction in logistics costs in small-scale logistics enterprises, considering the demand on enterprises for simultaneous pick-up and delivery, as well as the cost of carbon emissions, this study considers the vehicle routing problem of simultaneous pick-up and delivery under a joint distribution model. First of all, an independent distribution model and a joint distribution model including fixed transportation, variable transportation, time penalty, and carbon emissions costs are established; second, by adding the self-adaption cross-mutation probability and the destruction and repair mechanism in the large-scale neighborhood search algorithm, the genetic algorithm is improved to adapt to the solution of the model in this paper, and the effectiveness of the improved algorithm is verified and analyzed. It is found that the improved genetic algorithm is more advantageous than the original algorithm for solving the problems of both models designed in this paper. Finally, the improved genetic algorithm is used to solve the two models, and the results are compared and analyzed. It is found that the joint distribution model can reduce the total cost by 6.61% and the carbon emissions cost by 5.73%. Additionally, the impact of the carbon trading mechanism on the simultaneous pick-up and delivery vehicle routing problem under the joint distribution model is further explored. The results of this study prove that enterprises can effectively reduce costs, improve profits, reduce carbon emissions, and promote the sustainable development of logistics enterprises under the condition of joint distribution.

41

Sun, Yan, Maoxiang Lang, and Danzhu Wang. "Optimization Models and Solution Algorithms for Freight Routing Planning Problem in the Multi-Modal Transportation Networks: A Review of the State-of-the-Art." Open Civil Engineering Journal 9, no. 1 (September 17, 2015): 714–23. http://dx.doi.org/10.2174/1874149501509010714.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

With the remarkable development of international trade, global commodity circulation has grown significantly. To accomplish commodity circulation among various regions and countries, multi-modal transportation scheme has been widely adopted by a large number of companies. Meanwhile, according to the relevant statistics, the international logistics costs reach up to approximate 30-50% of the total production cost of the companies. Lowering the transportation costs has become one of the most important sources for a company to raise profits and maintain competitiveness in the global market. Thus, how to optimize freight routes selection to move commodities through the multi-modal transportation network has gained great concern of both the decision makers of the companies and the multi-modal transport operators. In this study, we present a systematical review on the multi-modal transportation freight routing planning problem from the aspects of model formulation and algorithm design. Following contents are covered in this review: (1) distinguishing the formulation characteristics of various optimization models; (2) identifying the optimization models in recent studies according to the formulation characteristics; and (3) discussing the solution approaches that are developed to solve the optimization models, especially the heuristic algorithms.

42

Shafiee Moghadam, Shayan, Amir Aghsami, and Masoud Rabbani. "A hybrid NSGA-II algorithm for the closed-loop supply chain network design in e-commerce." RAIRO - Operations Research 55, no. 3 (May 2021): 1643–74. http://dx.doi.org/10.1051/ro/2021068.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Designing the supply chain network is one of the significant areas in e-commerce business management. This concept plays a crucial role in e-commerce systems. For example, location-inventory-pricing-routing of an e-commerce supply chain is considered a crucial issue in this field. This field established many severe challenges in the modern world, like maintaining the supply chain for returned items, preserving customers’ trust and satisfaction, and developing an applicable supply chain with cost considerations. The research proposes a multi-objective mixed integer nonlinear programming model to design a closed-loop supply chain network based on the e-commerce context. The proposed model incorporates two objectives that optimize the business’s total profits and the customers’ satisfaction. Then, numerous numerical examples are generated and solved using the epsilon constraint method in GAMS optimization software. The validation of the given model has been tested for the large problems via a hybrid two-level non-dominated sort genetic algorithm. Finally, some sensitivity analysis has been performed to provide some managerial insights.

43

Beer, Sebastian, Ruud de Mooij, Shafik Hebous, Michael Keen, and Li Liu. "Exploring Residual Profit Allocation." American Economic Journal: Economic Policy 15, no. 1 (February 1, 2023): 70–109. http://dx.doi.org/10.1257/pol.20200212.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Residual profit allocation (RPA) schemes have come to prominence in discussions of international tax reform but with almost nothing known about their economic impact. These schemes tax multinationals by allocating their “routine” profits to source countries and sharing their remaining “residual” profit across countries on some formulaic basis. This paper explores the implications, conceptual and empirical, of moving to some form of RPA. Residual profits are estimated to be substantial and concentrated in relatively few multinational enterprises. The impact on tax revenue appears beneficial for developing countries. Aggregate production efficiency is unlikely to increase unless routine profits are lightly taxed. (JEL F23, H25, H87, L25)

44

Mo, Haipeng, Chun Deng, Yuting Chen, and Yuchen Huang. "Partner Matching Mechanism of Hainan Cold Chain Logistics Based on Multiobjective Optimization." Mathematical Problems in Engineering 2022 (September 27, 2022): 1–9. http://dx.doi.org/10.1155/2022/5506338.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

With the sustained and rapid development of the economy, the food consumption structure has changed correspondingly and the market of cold and fresh products has developed rapidly, which puts forward the matching of cold chain logistics. Under the background of the construction of the belt and road and the pilot-free trade zone, the organic integration of the fresh agricultural products market and industry in Hainan is facing opportunities and challenges. In particular, in-depth research on the design and planning of the entire logistics system has not been carried out and the research on the distribution vehicle routing problem is still in the initial stage. This paper combs the relevant policies of cold chain logistics development in Hainan province. Given the imperfect system, the lack of policy guarantee measures, and the lack of regionality of the policy objective system, this paper puts forward some suggestions for improvement. The effective inventory control model of Hainan fresh agricultural products under cold chain logistics is explored by using the inventory management theory and the related theory of system dynamics. The simulation is carried out by using Vensim software, which provides a reference for improving the status of cold chain logistics of fresh agricultural products in Hainan. By saving funds, the profits of cold and fresh products are increased and the market competitiveness is improved.

45

Matsui, Masayuki, and Liping Wang. "An Economic/Lead-Time Design Comparison and Map for Central Server Systems Including FMS." International Journal of Automation Technology 1, no. 1 (September 5, 2007): 35–44. http://dx.doi.org/10.20965/ijat.2007.p0035.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper presents an economic/lead-time design comparison and pair-matrix table for Central Server Systems including a flexible manufacturing system (FMS), and reconsiders the strategic/ellipse map in four routing strategies. First, the CSM incorporating four routings and a sales center is considered under economics/lead-time. The central server corresponds to a parts warehouse in FMS, regarded as a sales/profit center. Second, production/service center operating cost is obtained analytically by the sum of inventory, busy, idle and blocking cost, and the economic traffic (optimal number of parts) is decided by maximizing the marginal profit (= sales price - operating cost). Third, buffers, throughput and lead time under economic traffic are obtained at the second stage based on 2-stage design. Fourth, strategic design management under a profit and lead-time correlation is discussed for the pair-matrix table, and the ellipse shape is found for four routing types in the CSM with sales. We also propose new hybrid routing and quantitatively demonstrate its superiority.

46

Fulgence, Konan Amani, Tanou Yoboué Kouassi Évariste, and Jérome Aloko-N’Guessan. "Usage des TIC dans l’Approvisionnement de la Région du Haut-sassandra en Produits Carburants." European Scientific Journal, ESJ 19, no. 17 (June 30, 2023): 49. http://dx.doi.org/10.19044/esj.2023.v19n17p49.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

En Côte d’Ivoire, les produits pétroliers convoyés et distribués aux populations dans la région du Haut-Sassandra sont issus des entités portuaires d’Abidjan. Depuis ces dernières décennies, les Technologies de l’Information et de la Communication (TIC) régulent les flux pétroliers acheminés aux usagers. Néanmoins, les actes traditionnels dans la satisfaction des utilisateurs des produits carburants peinent à connaitre une réelle amélioration. Cette étude se propose de montrer l’impact des TIC dans le processus d’acheminement de ces frets pétroliers d’Abidjan vers le Haut-Sassandra. Suite à la recherche documentaire, l’enquête de terrain est axée sur une série d’entretien avec des marketeurs, des pompistes, des transporteurs de camions citernes et des automobilistes. Ainsi, dans le processus de diffusion des produits carburants dans le Haut-Sassandra, les TIC permettent la disparition des barrières physiques et spatio-temporelles. Excepté le contact permanent entre les acteurs du réseau de distribution, la téléphonie mobile et le GPS sont indéniables pour anticiper d’éventuelles pénuries à la station-service. Cette présence régulière de produits carburants dans la région du Haut-Sassandra accroit ainsi les profits pécuniaires de ces promoteurs. Mais, malgré l’avènement des TIC dans le paysage ivoirien, les structures étatiques peinent à suivre et contrôler en temps réel les trafics pétroliers des entités vers les régions nationales. In Côte d'Ivoire, the petroleum products transported and distributed to the populations in the Haut-Sassandra region come from the port entities of Abidjan. For the past few decades, Information and Communication Technologies (ICT) have been regulating the flow of oil products to users. Nevertheless, the traditional acts in the satisfaction of users of fuel products are struggling to make a real improvement. This study proposes to show the impact of ICT in the process of routing these oil freights from Abidjan to the Haut-Sassandra. Following the documentary research, the field survey is centered on a series of interviews with marketers, pumpers, tanker transporters and motorists. Thus, in the process of disseminating fuel products in the Haut-Sassandra, ICTs allow physical and spatio-temporal barriers to disappear. Apart from the permanent contact between the actors of the distribution network, mobile telephony and GPS are undeniable for anticipating possible shortages at the service station. This regular presence of fuel products in the Haut-Sassandra region thus increases the financial profits of these promoters. However, despite the advent of ICTs in the Ivorian landscape, state structures are struggling to monitor and control in real time oil traffic from the entities to the national regions.

47

Alhindi, Ahmad, Abrar Alsaidi, and Amr Munshi. "Vehicle Routing Optimization for Non-Profit Organization Systems." Information 13, no. 8 (August 4, 2022): 374. http://dx.doi.org/10.3390/info13080374.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The distributor management system has long been a challenge for many organizations and companies. Overall, successful distribution involves several moving entities and methods, requiring a resilient distribution management strategy powered by data analysis. For nonprofit organizations, the distribution system requires efficient distribution and management. This includes minimizing time, distance, and cost. As a consequence, service quality and financial efficiency can be achieved. This paper proposes a methodology to tackle the vehicle routing problems (VRP) faced by nonprofit organizations. The methodology consists of four subsequent approaches—greedy, intraroute, interroute, and tabu search—to improve the functionality and performance of nonprofit organizations. The methodology was validated by applying it to a real nonprofit organization. Furthermore, the proposed system was compared to another state-of-the-art system; the achieved results were satisfactory and suggest that this methodology is capable of handling the VRP accordingly, improving the functionality and performance of nonprofit organizations.

48

Sheikh, Adil A., Atif Naseer, and Emad Felemban. "PRoFIT—Priority-Based Routing Framework for Image Transmission in Visual Sensor Networks." International Journal of Future Computer and Communication 8, no. 1 (March 2019): 6–10. http://dx.doi.org/10.18178/ijfcc.2019.8.1.531.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Wang, Yong, Xiaolei Ma, Zhibin Li, Yong Liu, Maozeng Xu, and Yinhai Wang. "Profit distribution in collaborative multiple centers vehicle routing problem." Journal of Cleaner Production 144 (February 2017): 203–19. http://dx.doi.org/10.1016/j.jclepro.2017.01.001.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Wilkie, J. Scott. "Policy Forum: The Way We Were? The Way We Must Be? The Arms Length Principle Sees Itself (for What It Is) in the Digital Mirror." Intertax 47, Issue 12 (December 1, 2019): 1087–102. http://dx.doi.org/10.54648/taxi2019111.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Under the first pillar, focused on the allocation of taxing rights including nexus issues, several proposals have been made that would allocate more taxing rights to market or user jurisdictions in situations where value is created by a business activity through participation in the user or market jurisdiction that is not recognized in the framework for allocating profits. … Some of the proposals would require reconsidering the current transfer pricing rules as they relate to non-routine returns, and other proposals would entail modifications potentially going beyond non-routine returns. In all cases, these proposals would lead to solutions that go beyond the arm’s length principle (OECD, Addressing the Tax Challenges of the Digitalisation of the Economy – Policy Note, OECD/G20 Base Erosion and Profit Shifting Project 2 (OECD Publishing Jan. 2019). See also, the G20, G20 Leaders’ Declaration: Building Consensus for Fair and Sustainable Development, Buenos Aires Summit (1 December 2018), paragraph 26).

Статті в журналах з теми "Routing with profits"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями