The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In the orienteering problem (OP) a set of locations is given, each with a score. The goal is to determine a route, limited in length, that visits some locations and maximize the sum of the collected scores. The orienteering problem is often used as a starting point for modeling many combinatorial optimization problems. This paper studies the time-dependent orienteering problem taking into account...
The main purpose of this paper is to establish a reverse logistics coordination mechanism according to Chinese real conditions. Here we focus on analyzing the situation of e-waste recycling in china. By comparing the advanced experience of developed countries, especially the application of EPR in EU, we try to find out where the problem lies in China. Finally, a model which considers the government...
Adapting to freight transport new demands of reliability, timely delivery and flexibility, port supply chain is in teg lilted maritime transport and inland transport sub-systems, seamless connecting with “first mile” and “last mile”, learning from Cobb-Douglas production function, combined game theory and based on advertising-R&D model, from the perspective of the port supply chain analyzing game...
In this paper, we consider a transportation network with emission charge and congestion toll on each link. All users in this network are classified by value of time and value of emission. They choose travel route in the logit-based stochastic manner. In order to illustrate that link tolls are economic, efficient, and theoretically feasible, we present a multi-modal multi-objective traffic network...
Most tourists today expect a friendly tour guidance and services considering their individual preferences and actual situation while protecting their privacy. The ideal is an intelligent guide taking care of the whole organization and execution in time. This is the main objective of the context-based Personalized Mobile Tourist Guide (PMTG). Tourist's profiles or visiting background is stored in a...
In this research, our aim is to increase the efficiency of individual visitors and the whole system by reducing traffic congestion in large-scale crowdpsilas activities. To achieve the goal, a route guidance mechanism with centralized information control (CIC) is proposed by granting priority to visitors using CIC. Through multi-agent simulation, we confirmed that the CIC mechanism was effective in...
In order to reduce the phenomena of long time queuing and congestion in large-scale crowds' activities, improve the visitors' satisfaction and increase social welfare, a multi-stage dynamic coordination model for large scale crowds' activities based on multi-agent is proposed and a coordination algorithm PCI is designed. Three types of basic coordination algorithms are tested by computer simulation,...
In this paper we analyze the structural properties of four urban street networks in China based on GIS and complex networks theory. We consider the street networks as spatial networks and use the primal approach to turn the GIS data into graph. The urban street networks display similar topological patterns and deviate from random networks and central planned networks, despite the apparent differences...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.