• Complex
  • Title
  • Author
  • Keyword
  • Abstract
  • Scholars
Search
High Impact Results & Cited Count Trend for Year Keyword Cloud and Partner Relationship

Query:

学者姓名:徐寅峰

Refining:

Source

Submit Unfold

Co-Author

Submit Unfold

Language

Submit

Clean All

Export Sort by:
Default
  • Default
  • Title
  • Year
  • WOS Cited Count
  • Impact factor
  • Ascending
  • Descending
< Page ,Total 34 >
Selfish load balancing for jobs with favorite machines EI SCIE
期刊论文 | 2019 , 47 (1) , 7-11 | Operations Research Letters
Abstract&Keyword Cite

Abstract :

This paper studies the load balancing game for the favorite machine model, where each job has a certain set of favorite machines with the shortest processing time for the job. We obtain tight bounds on the Strong Price of Anarchy (strong PoA) for the general favorite machine model and a special case of the model. Our results generalize the well-known bounds on the strong PoA for the unrelated machine and identical machine models. © 2018 Elsevier B.V.

Keyword :

Identical machines Machine modeling Price of anarchy Shortest Processing Time Tight bound Unrelated machines

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Chen, Cong , Xu, Yinfeng . Selfish load balancing for jobs with favorite machines [J]. | Operations Research Letters , 2019 , 47 (1) : 7-11 .
MLA Chen, Cong 等. "Selfish load balancing for jobs with favorite machines" . | Operations Research Letters 47 . 1 (2019) : 7-11 .
APA Chen, Cong , Xu, Yinfeng . Selfish load balancing for jobs with favorite machines . | Operations Research Letters , 2019 , 47 (1) , 7-11 .
Export to NoteExpress RIS BibTex
Online minimum latency problem with edge uncertainty EI Scopus SCIE
期刊论文 | 2019 , 273 (2) , 418-429 | European Journal of Operational Research
Abstract&Keyword Cite

Abstract :

Given a tour in a metric space, the latency of the vertex v is the distance traveled along the tour starting from the root and arriving at v for the first time. The minimum latency problem (MLP) is to find a tour visiting all given vertices such that the total latency of these vertices is minimized. We consider an online variant in traffic networks, where as many as ℓ edges are to be blocked during the traversal, for a non-negative integer ℓ. We first prove a lower bound on the competitive ratio for any online algorithm and then propose an online algorithm GoodTreeTraversal, which is demonstrated to be near optimal if there is a good k-tree for every k in the range from 2 to n and the number of blockages is large enough. We also present a polynomial time heuristic algorithm called Detour, which is much faster than GoodTreeTraversal. The numerical experiments demonstrate the efficiency and effectiveness of our two algorithms. © 2018 Elsevier B.V.

Keyword :

Canadian traveler problem Competitive ratio Minimum latency problems Nonnegative integers Numerical experiments On-line algorithms Routing Traffic networks

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Huili , Tong, Weitian , Lin, Guohui et al. Online minimum latency problem with edge uncertainty [J]. | European Journal of Operational Research , 2019 , 273 (2) : 418-429 .
MLA Zhang, Huili et al. "Online minimum latency problem with edge uncertainty" . | European Journal of Operational Research 273 . 2 (2019) : 418-429 .
APA Zhang, Huili , Tong, Weitian , Lin, Guohui , Xu, Yinfeng . Online minimum latency problem with edge uncertainty . | European Journal of Operational Research , 2019 , 273 (2) , 418-429 .
Export to NoteExpress RIS BibTex
Car-sharing between two locations: Online scheduling with two servers EI Scopus
会议论文 | 2018 , 117 | 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018
Abstract&Keyword Cite

Abstract :

In this paper, we consider an on-line scheduling problem that is motivated by applications such as car sharing, in which users submit ride requests, and the scheduler aims to accept requests of maximum total profit using two servers (cars). Each ride request specifies the pick-up time and the pick-up location (among two locations, with the other location being the destination). The length of the time interval between the submission of a request (booking time) and the pick-up time is fixed. The scheduler has to decide whether or not to accept a request immediately at the time when the request is submitted. We present lower bounds on the competitive ratio for this problem and propose a smart greedy algorithm that achieves the best possible competitive ratio. © Kelin Luo, Thomas Erlebach, and Yinfeng Xu.

Keyword :

Car sharing system Competitive analysis Competitive ratio Greedy algorithms Lower bounds Online scheduling Time interval Total profits

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Luo, Kelin , Erlebach, Thomas , Xu, Yinfeng . Car-sharing between two locations: Online scheduling with two servers [C] . 2018 .
MLA Luo, Kelin et al. "Car-sharing between two locations: Online scheduling with two servers" . (2018) .
APA Luo, Kelin , Erlebach, Thomas , Xu, Yinfeng . Car-sharing between two locations: Online scheduling with two servers . (2018) .
Export to NoteExpress RIS BibTex
Car-sharing between two locations: Online scheduling with flexible advance bookings EI Scopus
会议论文 | 2018 , 10976 LNCS , 242-254 | 24th International Conference on Computing and Combinatorics Conference, COCOON 2018
Abstract&Keyword Cite

Abstract :

We study an on-line scheduling problem that is motivated by applications such as car-sharing. Users submit ride requests, and the scheduler aims to accept requests of maximum total profit using a single server (car). Each ride request specifies the pick-up time and the pick-up location (among two locations, with the other location being the destination). The scheduler has to decide whether or not to accept a request immediately at the time when the request is submitted (booking time). We consider two variants of the problem with respect to constraints on the booking time: In the fixed booking time variant, a request must be submitted a fixed amount of time before the pick-up time. In the variable booking time variant, a request can be submitted at any time during a certain time interval that precedes the pick-up time. We present lower bounds on the competitive ratio for both variants and propose a greedy algorithm that achieves the best possible competitive ratio. © 2018, Springer International Publishing AG, part of Springer Nature.

Keyword :

Competitive ratio Greedy algorithms Lower bounds Online scheduling Single server Time interval Time variant Total profits

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Luo, Kelin , Erlebach, Thomas , Xu, Yinfeng . Car-sharing between two locations: Online scheduling with flexible advance bookings [C] . 2018 : 242-254 .
MLA Luo, Kelin et al. "Car-sharing between two locations: Online scheduling with flexible advance bookings" . (2018) : 242-254 .
APA Luo, Kelin , Erlebach, Thomas , Xu, Yinfeng . Car-sharing between two locations: Online scheduling with flexible advance bookings . (2018) : 242-254 .
Export to NoteExpress RIS BibTex
On-line scheduling with monotone subsequence constraints EI Scopus
期刊论文 | 2018 | Theoretical Computer Science
Abstract&Keyword Cite

Abstract :

In this paper, we study an on-line scheduling problem that is motivated by applications such as carpooling. The ride requests arrive on-line over-list and specify the service locations (among m locations). The goal is to determine a schedule that maximizes the number of satisfied requests using k servers. We consider two variants of the problem with respect to constraints on the service location: in the monotone service direction variant, the service locations of the requests assigned to a server must be monotonic; in the strict monotone service direction variant, the service locations must be strictly monotonic. We present lower bounds on the competitive ratio for both variants. For the monotone service direction variant, we give an optimal straightforward algorithm if k≥m and we prove that no deterministic on-line algorithm can achieve a constant competitive ratio if k<m. For the strict monotone service direction variant, we give a lower bound max⁡{[Formula presented],1} on the competitive ratio of barely deterministic algorithms if k>2, and a lower bound of max⁡{[Formula presented],1} if k≤2. We propose a Balanced Interval Algorithm for the strict monotone service direction variant if k>2 and report some numerical experiments to evaluate the efficiency of this algorithm. © 2018 Elsevier B.V.

Keyword :

Competitive analysis Competitive ratio Deterministic algorithms Interval algorithms Monotone subsequence Numerical experiments On-line algorithms Online scheduling

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Luo, Kelin , Xu, Yinfeng , Zhang, Huili . On-line scheduling with monotone subsequence constraints [J]. | Theoretical Computer Science , 2018 .
MLA Luo, Kelin et al. "On-line scheduling with monotone subsequence constraints" . | Theoretical Computer Science (2018) .
APA Luo, Kelin , Xu, Yinfeng , Zhang, Huili . On-line scheduling with monotone subsequence constraints . | Theoretical Computer Science , 2018 .
Export to NoteExpress RIS BibTex
Single vehicle’s package delivery strategy with online traffic congestion of certain delay time EI Scopus
会议论文 | 2018 , 10823 LNCS , 212-223 | 12th International Frontiers of Algorithmics Workshop, FAW 2018
Abstract&Keyword Cite

Abstract :

Urban package delivery by single vehicle can be modeled as online Steiner travelling salesman problem. This paper investigates the scenario that delay time of traffic congestion is certain and of real-time information to delivery vehicle, the vehicle can obtain specific delay time of traffic congestion just upon reaching an end vertex of the corresponding edge. Given a graph G = (V, E) and a subset D in V, the goal is to design a minimum-weight closed tour that departs from the depot s in D and returns to s after visiting each destination node in D at least once. When delivery vehicle encounters at most k times of traffic congestion, we first show {k + 1,ρΣ+ 1} is a lower bound on competitive ratio for the problem, where ρΣis the ratio compared sum of delay time of all congested edges with cost of optimal route. We further present an online algorithm for the problem with its competitive ratio proved to be very close to the lower bound. © 2018, Springer International Publishing AG, part of Springer Nature.

Keyword :

Competitive analysis Competitive ratio Delivery vehicle Destination nodes On-line algorithms Package delivery Real-time information Travelling salesman problem

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Li, Songhua , Xu, Yinfeng . Single vehicle’s package delivery strategy with online traffic congestion of certain delay time [C] . 2018 : 212-223 .
MLA Li, Songhua et al. "Single vehicle’s package delivery strategy with online traffic congestion of certain delay time" . (2018) : 212-223 .
APA Li, Songhua , Xu, Yinfeng . Single vehicle’s package delivery strategy with online traffic congestion of certain delay time . (2018) : 212-223 .
Export to NoteExpress RIS BibTex
A randomized competitive group testing procedure EI SCIE Scopus
期刊论文 | 2018 , 35 (3) , 667-683 | JOURNAL OF COMBINATORIAL OPTIMIZATION
Abstract&Keyword Cite

Abstract :

In many fault detection problems, we want to identify all defective items from a set of n items using the minimum number of tests. Group testing is for the scenario where each test is on a subset of items, and tells whether the subset contains at least one defective item or not. In practice, the number d of defective items is often unknown in advance. In this paper, we propose a randomized group testing procedure RGT for the scenario where the number d of defectives is unknown in advance, and prove that RGT is competitive. By incorporating numerical results, we obtain improved upper bounds on the expected number of tests performed by RGT, for . In particular, for and the special case where n is a power of 2, we obtain an upper bound of with on the expected number of tests performed by RGT, which is better than the currently best upper bound in Cheng et al. (INFORMS J Comput 26(4):677-689, 2014). We conjecture that the above improved upper bounds based on numerical results from actually hold for all d >= 1.

Keyword :

Group testing Fault detection Expectation Randomized algorithms

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Guiqing , Cheng, Yongxi , Xu, Yinfeng . A randomized competitive group testing procedure [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 35 (3) : 667-683 .
MLA Zhang, Guiqing et al. "A randomized competitive group testing procedure" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 35 . 3 (2018) : 667-683 .
APA Zhang, Guiqing , Cheng, Yongxi , Xu, Yinfeng . A randomized competitive group testing procedure . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 35 (3) , 667-683 .
Export to NoteExpress RIS BibTex
Online covering salesman problem EI SCIE Scopus
期刊论文 | 2018 , 35 (3) , 941-954 | JOURNAL OF COMBINATORIAL OPTIMIZATION
Abstract&Keyword Cite

Abstract :

Given a graph , the generalized covering salesman problem (CSP) is to find a shortest tour in G such that each vertex is either on the tour or within a predetermined distance L to an arbitrary vertex on the tour, where ,. In this paper, we propose the online CSP, where the salesman will encounter at most k blocked edges during the traversal. The edge blockages are real-time, meaning that the salesman knows about a blocked edge when it occurs. We present a lower bound and a CoverTreeTraversal algorithm for online CSP which is proved to be -competitive, where , is the approximation ratio for Steiner tree problem and is the maximal number of locations that a customer can be served. When , our algorithm is near optimal. The problem is also extended to the version with service cost, and similar results are derived.

Keyword :

Realtime blockage Service cost Covering salesman problem Competitive analysis

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Huili , Xu, Yinfeng . Online covering salesman problem [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 35 (3) : 941-954 .
MLA Zhang, Huili et al. "Online covering salesman problem" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 35 . 3 (2018) : 941-954 .
APA Zhang, Huili , Xu, Yinfeng . Online covering salesman problem . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 35 (3) , 941-954 .
Export to NoteExpress RIS BibTex
Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead EI SCIE Scopus
期刊论文 | 2018 , 36 (2) , 617-636 | JOURNAL OF COMBINATORIAL OPTIMIZATION
Abstract&Keyword Cite

Abstract :

This paper studies an online over-list model of the integrated allocation of berths and quay cranes (QCs) in container terminals with 1-lookahead ability. The objective is to minimize the maximum completion time of container vessels, i.e., the makespan. We focus on two different types of vessels, three berths and a small number of QCs in the hybrid berth layout, with 1-lookahead ability. We propose a -competitive algorithm for the case with four cranes, a 5/4-competitive algorithm for the case with five cranes and a 4/3-competitive algorithm for the case with six cranes, respectively. All of the algorithms are proved to be optimal.

Keyword :

Scheduling Container terminal Online algorithm Lookahead information

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Pan, Jiayin , Xu, Yinfeng , Zhang, Guiqing . Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead [J]. | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 36 (2) : 617-636 .
MLA Pan, Jiayin et al. "Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead" . | JOURNAL OF COMBINATORIAL OPTIMIZATION 36 . 2 (2018) : 617-636 .
APA Pan, Jiayin , Xu, Yinfeng , Zhang, Guiqing . Online integrated allocation of berths and quay cranes in container terminals with 1-lookahead . | JOURNAL OF COMBINATORIAL OPTIMIZATION , 2018 , 36 (2) , 617-636 .
Export to NoteExpress RIS BibTex
Minimum deviation ordinal consensus reaching in GDM with heterogeneous preference structures EI SSCI CPCI-S SCIE Scopus
会议论文 | 2018 , 67 , 658-676 | IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) held as part of IEEE World Congress on Computational Intelligence (IEEE WCCI)
WoS CC Cited Count: 1 SCOPUS Cited Count: 2
Abstract&Keyword Cite

Abstract :

This study presents a novel minimum deviation ordinal consensus model (MDOCM) for group decision making with heterogeneous preference structures (utility values, preference orderings, multiplicative preference relations and fuzzy preference relations). In this consensus model, the individual derivation methods, associated with different preference structures, are used to obtain the individual preference orderings. Then, the median ranking model is proposed to obtain the group preference ordering, which can ensure to obtain a maximum consensus level among the decision makers when the individual preference orderings are given. Furthermore, we propose the minimum deviation consensus ranking model (MDCRM), which seeks to minimize the ordinal information deviation between the original and adjusted preference orderings in the process of reaching consensus, and study the properties of the optimal solution to MDCRM. Finally, based on the MDCRM, the feedback adjustment rules are presented to help decision makers reach consensus. (C) 2017 Elsevier B.V. All rights reserved.

Keyword :

Heterogeneous preference structures Ordinal consensus model Group decision making Minimum information deviation

Cite:

Copy from the list or Export to your reference management。

GB/T 7714 Zhang, Bowen , Liang, Haiming , Zhang, Guiqing et al. Minimum deviation ordinal consensus reaching in GDM with heterogeneous preference structures [C] . 2018 : 658-676 .
MLA Zhang, Bowen et al. "Minimum deviation ordinal consensus reaching in GDM with heterogeneous preference structures" . (2018) : 658-676 .
APA Zhang, Bowen , Liang, Haiming , Zhang, Guiqing , Xu, Yinfeng . Minimum deviation ordinal consensus reaching in GDM with heterogeneous preference structures . (2018) : 658-676 .
Export to NoteExpress RIS BibTex
10| 20| 50 per page
< Page ,Total 34 >

Export

Results:

Selected

to

Format:
FAQ| About| Online/Total:3094/55032098
Address:XI'AN JIAOTONG UNIVERSITY LIBRARY(No.28, Xianning West Road, Xi'an, Shaanxi Post Code:710049) Contact Us:029-82667865
Copyright:XI'AN JIAOTONG UNIVERSITY LIBRARY Technical Support:Beijing Aegean Software Co., Ltd.