全文获取类型
收费全文 | 243篇 |
免费 | 16篇 |
国内免费 | 1篇 |
专业分类
财政金融 | 2篇 |
工业经济 | 10篇 |
计划管理 | 123篇 |
经济学 | 2篇 |
综合类 | 7篇 |
运输经济 | 54篇 |
贸易经济 | 54篇 |
农业经济 | 1篇 |
经济概况 | 7篇 |
出版年
2023年 | 4篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 4篇 |
2019年 | 7篇 |
2018年 | 5篇 |
2017年 | 9篇 |
2016年 | 18篇 |
2015年 | 9篇 |
2014年 | 35篇 |
2013年 | 17篇 |
2012年 | 31篇 |
2011年 | 20篇 |
2010年 | 15篇 |
2009年 | 13篇 |
2008年 | 21篇 |
2007年 | 17篇 |
2006年 | 13篇 |
2005年 | 6篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2000年 | 1篇 |
1998年 | 1篇 |
排序方式: 共有260条查询结果,搜索用时 15 毫秒
11.
This problem involves optimizing product collection and redistribution from production locations to a set of processing plants over a planning horizon. This horizon consists of several days, and the collection-redistribution is performed on a repeating daily basis. A single routing plan must be prepared for the whole horizon, taking into account the seasonal variations in the supply. We model the problem using a sequence of periods, each corresponding to a season. We propose an adaptive large-neighborhood search with several specifically designed operators and features. The results show the excellent performance of the algorithm in terms of solution quality and computational efficiency. 相似文献
12.
After a disaster, restoring accessibility in the affected area is critical for response operations. We study two arc routing problems for clearing blocked roads. The first problem minimizes the time to reconnect the road network, while the second maximizes the total benefit gained by reconnecting network components within a time limit. For each problem, we develop a mixed integer programming formulation and two versions of a heuristic algorithm. We conduct computational experiments on Istanbul data and instances adapted from the literature. The heuristics achieve near-optimal or optimal solutions quickly in most of the tested instances. 相似文献
13.
Michael Huang Burcu Balcik 《Transportation Research Part E: Logistics and Transportation Review》2012,48(1):2-18
In humanitarian relief operations, vehicle routing and supply allocation decisions are critically important. Similar routing and allocation decisions are studied for commercial settings where efficiency, in terms of minimizing cost, is the primary objective. Humanitarian relief is complicated by the presence of multiple objectives beyond minimizing cost. Routing and allocation decisions should result in quick and sufficient distribution of relief supplies, with a focus on equitable service to all aid recipients. However, quantifying such goals can be challenging. In this paper, we define and formulate performance metrics in relief distribution. We focus on efficacy (i.e., the extent to which the goals of quick and sufficient distribution are met) and equity (i.e., the extent to which all recipients receive comparable service). We explore how efficiency, efficacy, and equity influence the structure of vehicle routes and the distribution of resources. We identify trends and routing principles for humanitarian relief based on the analytical properties of the resulting problems and a series of computational tests. 相似文献
14.
Researchers and public agencies have proposed consolidation policies as an alternative to increase truck payload utilization and mitigate externalities produced by freight transportation. Understanding and enhancing the economic mechanisms that lead to freight consolidation can ease the implementation of these strategies, increase profits for shippers and carriers, and reduce freight-related negative externalities. An important mechanism that has recently been studied for cost reduction in the freight industry is combinatorial auctions. In these auctions, a shipper invites a set of carriers to submit bids for freight lane contracts. Carriers can bid for individual lanes or bundles of them according to their operational characteristics. These bids are constructed considering direct shipments (Truckload operations) and several biding advisory models have been proposed for this purpose. However, there are economies of scale that can be achieved if shipments are consolidated inside vehicles, which have not been explored in the construction of competitive bids. This paper investigates such benefits and provides insights on the competitiveness and challenges associated to the development of consolidated bids (suitable for Less-Than-Truckload operations). Consolidated bids are constructed using a multi-commodity one-to-one pickup-and-delivery vehicle routing problem that is solved using a branch-and-price algorithm. The numerical experiment shows that non-consolidated bids are dominated by consolidated bids, which implies that this type of operation can increase the likelihood of a carrier to win auctioned lanes, while increasing its profits margins over truckload companies (non-consolidated bids), and keeping the reported benefits that combinatorial auctions represent for shippers. 相似文献
15.
针对无线传感器网络分簇算法中能量分布不均衡导致的"热区"和簇头负载过重问题,提出了一种基于PSO算法优化簇头选举的非均匀分簇算法。在候选簇头选举和竞争半径计算过程中综合考虑节点动态能量、节点密度和节点距基站距离,将网络进行非均匀分簇,并引入PSO算法进行最终簇头选举。根据节点能量、节点密度和距基站距离确定簇间单跳多跳结合的路由规则,选取代价函数小的节点作为下一跳节点。基于节点信息熵确定融合阈值,进行簇内数据融合剔除冗余数据。仿真结果表明,改进算法的数据传输量比EEUC算法和UCRA算法分别提高了20%和10%,提升了数据的融合效率,有效延长了网络生命周期,簇头能量消耗得到均衡,减少了网络能量消耗,网络的整体性能显著优于其他对比算法。 相似文献
16.
17.
讨论了一类时变路网下的无能力约束车辆配送路径优化问题,建立了基于时变路网的以配送总耗时最短为优化目标的无能力约束车辆配送路径优化模型。提出了基于实时Dijkstra算法的模型求解方法。数值算例表明考虑路网时变特性得到的优化配送方案将更加符合配送实际。 相似文献
18.
This paper considers a supply chain network with multiple depots and geographically dispersed customers, each of which faces non-constant demand over a discrete planning horizon. The goal is to determine a set of depots to open, the delivery quantities to customers per period and the sequence in which they are replenished by a vehicle fleet such that the total system-wide cost is minimized. To solve it, first we construct a mixed integer program, and then propose a hybrid metaheuristic consisting of initialization, intensification and post-optimization. Results show that the proposed heuristic is considerably efficient and effective for many classical instances. 相似文献
19.
Farshid Azadian Alper E. Murat Ratna Babu Chinnam 《Transportation Research Part E: Logistics and Transportation Review》2012,48(1):355-372
The route planning of time-sensitive air-cargo is becoming more important with the growing air-network congestion and delays. We consider a freight forwarder’s routing of a time-sensitive air-cargo in the presence of real-time and historical information regarding flight availability, departure delays and travel times. A departure delay estimation model is developed to account for real-time information inaccuracy. A novel Markov decision model is formulated and solved with online backward induction. Through synthetic experiments and case studies, we demonstrate that dynamic routing with real-time information can improve delivery reliability and reduce expected cost. 相似文献
20.